Query answering with DBoxes is hard

DOI10.1016/J.ENTCS.2011.10.007MaRDI QIDQ2825409zbMATH OpenOpenAlexWikidataFDO

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

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

conjunctive queriesdescription logicshybrid logicmodel theory

Mathematics Subject Classification ID

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

Recommendations

• Data complexity of query answering in description logics
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Data complexity of query answering in expressive description logics via tableaux
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• The data complexity of description logic ontologies

Cites work

• A tableau decision procedure for \(\mathcal{SHOIQ}\)
• Combining Horn rules and description logics in CARIN
• Conjunctive query answering for the description logic SHIQ
• Data complexity of query answering in description logics
• Data complexity of query answering in expressive description logics via tableaux
• Handbook of modal logic
• scientific article; zbMATH DE number 1189110 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Modal logic
• Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
• Tableau methods for modal and temporal logics
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family

Cited in

(7)

• Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
• Exact query reformulation with first-order ontologies and databases
• Ontology-Mediated Query Answering with Data-Tractable Description Logics
• The data complexity of ontology-mediated queries with closed predicates
• Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates
• Towards practicable defeasible reasoning for ABoxes
• Query answering in circumscribed OWL2 profiles

This page was built for publication: Query answering with DBoxes is hard

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