Compact query rewritings for ontology-based query answering

DOI10.1007/978-3-031-80283-6_1MaRDI QIDQ6970695zbMATH OpenFDO

Authors Michaël Thomazo

Publication date 17 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-80283-6_1

zbMATH Keywords

ontology-based query answeringquery rewriting

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Cites work

• A Proof Procedure for Data Dependencies
• Anatomy of the Chase
• Automata, languages and programming. Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981
• Equivalence of Datalog queries is undecidable
• Homomorphism preservation theorems
• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• On rules with existential variables: walking the decidability line
• Ontology-mediated queries. Combined complexity and succinctness of rewritings via circuit complexity
• Query Rewriting and Optimization for Ontological Databases
• Rewriting guarded existential rules into small Datalog programs
• 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 reasoning and efficient query answering in description logics: The DL-Lite family

This page was built for publication: Compact query rewritings for ontology-based query answering

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