Query answering with DBoxes is hard
DOI10.1016/J.ENTCS.2011.10.007zbMATH Open1347.68321OpenAlexW2085489403WikidataQ113318199 ScholiaQ113318199MaRDI QIDQ2825409FDOQ2825409
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
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
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Logic in artificial intelligence (68T27)
Cites Work
- Modal logic
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of modal logic
- Data complexity of query answering in description logics
- Title not available (Why is that?)
- Tableau methods for modal and temporal logics
- Title not available (Why is that?)
- Combining Horn rules and description logics in CARIN
- Conjunctive query answering for the description logic SHIQ
- Data complexity of query answering in expressive description logics via tableaux
- A tableau decision procedure for \(\mathcal{SHOIQ}\)
- Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
Cited In (6)
- Query answering in circumscribed OWL2 profiles
- Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates
- The data complexity of ontology-mediated queries with closed predicates
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Exact query reformulation with first-order ontologies and databases
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)
