2 problems

Let $\mathbf{fus}$ denote the class of rulesets considered in the paper, and let finite controllability mean that query entailment over such rulesets can be determined using finite…

Let $\mathbf{fus}$ be the class of existential rule sets with the relevant syntactic property, and let $\mathbf{fcs}$ be the class of finite-cliquewidth sets of rules. Containment…