Tractable query answering and rewriting under description logic constraints

DOI10.1016/j.jal.2009.09.004zbMath1192.68218OpenAlexW2038608154WikidataQ56988673 ScholiaQ56988673MaRDI QIDQ975872

Boris Motik, Héctor Pérez-Urbina, Ian Horrocks

Publication date: 11 June 2010

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2009.09.004

zbMATH Keywords

description logicsquery answeringquery rewritingincomplete databases

Mathematics Subject Classification ID

Database theory (68P15) Knowledge representation (68T30)

Related Items (13)

Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies ⋮ Unnamed Item ⋮ A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ Towards more expressive ontology languages: the query answering problem ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Reasoning on anonymity in Datalog ⋮ Reasoning and Query Answering in Description Logics ⋮ First-Order Resolution Methods for Modal Logics ⋮ Top-\(k\) retrieval for ontology mediated access to relational databases ⋮ Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog ⋮ Unnamed Item ⋮ Scalable Reasoning by Abstraction Beyond DL-Lite

Cites Work

• On the finite controllability of conjunctive query answering in databases under open-world assumption
• First-order query rewriting for inconsistent databases
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
• Data Complexity in the $\mathcal{EL}$ Family of Description Logics
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• Resolution Strategies as Decision Procedures
• Logical foundations of object-oriented and frame-based languages
• Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
• Rewriting Conjunctive Queries over Description Logic Knowledge Bases
• Answering queries using views: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tractable query answering and rewriting under description logic constraints