Query Answering with DBoxes is Hard

DOI10.1016/j.entcs.2011.10.007zbMath1347.68321OpenAlexW2085489403WikidataQ113318199 ScholiaQ113318199MaRDI QIDQ2825409

Enrico Franconi, İnanç Seylan, Yazmín Ibáñez-García

Publication date: 7 October 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.10.007

zbMATH Keywords

hybrid logicmodel theorydescription logicsconjunctive queries

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Query answering in circumscribed OWL2 profiles ⋮ Exact Query Reformulation with First-Order Ontologies and Databases ⋮ Unnamed Item ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog

Cites Work

• Data complexity of query answering in description logics
• Data complexity of query answering in expressive description logics via tableaux
• Combining Horn rules and description logics in CARIN
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• A tableau decision procedure for \(\mathcal{SHOIQ}\)
• Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend!
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Query Answering with DBoxes is Hard