Cites work
- A Step Up in Expressiveness of Decidable Fixpoint Logics
- Datalog vs first-order logic
- Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
- Equivalence of Datalog queries is undecidable
- Guarded negation
- Guarded-based disjunctive tuple-generating dependencies
- Homomorphism preservation theorems
- scientific article; zbMATH DE number 3723857 (Why is no real title available?)
- Linking Data to Ontologies
- Modal languages and bounded fragments of predicate logic
- On rules with existential variables: walking the decidability line
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- On the Restraining Power of Guards
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Querying the Guarded Fragment
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Taming the infinite chase: query answering under expressive relational constraints
- The bridge between regular cost functions and omega-regular languages
- The complexity of boundedness for guarded logics
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Towards more expressive ontology languages: the query answering problem
- Undecidable optimization problems for database logic programs
Cited in
(3)
This page was built for publication: Guarded Ontology-Mediated Queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015964)
