More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
The complexity of logic-based abduction
Journal of the ACM (JACM)
Usability issues in knowledge representation systems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Making database systems usable
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
On the provenance of non-answers to queries over extracted data
Proceedings of the VLDB Endowment
Laconic and Precise Justifications in OWL
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Explanation in the DL-Lite Family of Description Logics
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Ontologies and Databases: The DL-Lite Approach
Reasoning Web. Semantic Technologies for Information Systems
Explaining subsumption in description logics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
The complexity of circumscription in description logic
Journal of Artificial Intelligence Research
The DL-lite family and relations
Journal of Artificial Intelligence Research
How to ConQueR why-not questions
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Explaining missing answers to SPJUA queries
Proceedings of the VLDB Endowment
ABox Abduction in the Description Logic $\boldsymbol{\mathcal{ALC}}$
Journal of Automated Reasoning
A new matchmaking approach based on abductive conjunctive query answering
JIST'11 Proceedings of the 2011 joint international conference on The Semantic Web
| Hi-index | 0.00 |
In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services. This holds also for Description Logics, where research has focused on the explanation of both TBox reasoning and, more recently, query answering. Besides explaining the presence of a tuple in a query answer, it is important to explain also why a given tuple is missing. We address the latter problem for instance and conjunctive query answering over DL-Lite ontologies by adopting abductive reasoning; that is, we look for additions to the ABox that force a given tuple to be in the result. As reasoning tasks we consider existence and recognition of an explanation, and relevance and necessity of a given assertion for an explanation. We characterize the computational complexity of these problems for arbitrary, subset minimal, and cardinality minimal explanations.