Rewriting guarded existential rules into small Datalog programs

DOI10.4230/LIPICS.ICDT.2018.4MaRDI QIDQ3305347zbMATH OpenFDO

Authors Shqiponja Ahmetaj, Magdalena Ortiz, Mantas Šimkus

Publication date 6 August 2020

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2018.4

zbMATH Keywords

expressivenessdescriptive complexityquery rewritingexistential rules

Mathematics Subject Classification ID

Database theory (68P15) Logic in computer science (03B70)

Recommendations

• Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).
• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
• Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
• Fast query answering over existential rules
• Guarded-based disjunctive tuple-generating dependencies

Cites work

• scientific article; zbMATH DE number 1953134 (Why is no real title available?)
• A Proof Procedure for Data Dependencies
• Guarded-based disjunctive tuple-generating dependencies
• Modal languages and bounded fragments of predicate logic
• On the Restraining Power of Guards
• On the complexity of ontological reasoning under disjunctive existential rules
• Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
• Reasoning in description logics by a reduction to disjunctive datalog
• Rewriting Guarded Negation Queries
• Taming the infinite chase: query answering under expressive relational constraints
• The price of query rewriting in ontology-based data access
• Tractable query answering and rewriting under description logic constraints
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family

Cited in

(9)

• Guarded-based disjunctive tuple-generating dependencies
• Compact query rewritings for ontology-based query answering
• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
• Rewriting Guarded Negation Queries
• Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
• Fast query answering over existential rules
• Loop restricted existential rules and first-order rewritability for query answering
• The impact of active domain predicates on guarded existential rules
• The impact of active domain predicates on guarded existential rules

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Rewriting guarded existential rules into small Datalog programs

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