Polynomial combined first-order rewritings for linear and guarded existential rules

DOI10.1016/j.artint.2023.103936zbMath1524.68116OpenAlexW4367692475MaRDI QIDQ6108762

Georg Gottlob, Andreas Pieris, Marco Manna

Publication date: 26 July 2023

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2023.103936

zbMATH Keywords

query answeringconjunctive queriesguardednessontologiesquery rewritingexistential rulestuple-generating dependenciescombined approach

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Cites Work

• Unnamed Item
• Data exchange: semantics and query answering
• On rules with existential variables: walking the decidability line
• Testing containment of conjunctive queries under functional and inclusion dependencies
• The price of query rewriting in ontology-based data access
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
• Ontology-Mediated Queries
• Query Rewriting and Optimization for Ontological Databases
• Fast Query Answering over Existential Rules
• Linking Data to Ontologies

This page was built for publication: Polynomial combined first-order rewritings for linear and guarded existential rules