Guarded-based disjunctive tuple-generating dependencies

DOI10.1145/2976736MaRDI QIDQ5012571zbMATH OpenOpenAlexFDO

Authors Pierre Bourhis, Michael Morak, Andreas Pieris, M. Manna

Publication date 25 November 2021

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://www.research.ed.ac.uk/en/publications/74f8849a-ac27-4a9c-b380-702d5b8f5f1d

zbMATH Keywords

computational complexityconjunctive queriesdisjunctionexistential rulesguardednessquery answeringtuple-generating dependencies

Mathematics Subject Classification ID

Database theory (68P15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Towards efficient reasoning under guarded-based disjunctive existential rules
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• Querying the Guarded Fragment
• Rewriting guarded existential rules into small Datalog programs
• Querying the guarded fragment with transitivity

Cited in

(10)

• Distributed reasoning for restricted weakly-linear disjunctive tuple-generating dependencies
• Towards efficient reasoning under guarded-based disjunctive existential rules
• Rewriting guarded existential rules into small Datalog programs
• Formal Systems for Tuple and Equality Generating Dependencies
• Finite model reasoning over existential rules
• Restricted chase termination for existential rules: a hierarchical approach and experimentation
• Guarded Ontology-Mediated Queries
• When can we answer queries using result-bounded data interfaces?
• Reasoning on anonymity in Datalog+/--
• Decidability of querying first-order theories via countermodels of finite width

This page was built for publication: Guarded-based disjunctive tuple-generating dependencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012571)