Reasoning about explanations for negative query answers in \textit{DL-Lite}

DOI10.1613/JAIR.3870MaRDI QIDQ2865013zbMATH OpenOpenAlexFDO

Authors Diego Calvanese, Magdalena Ortiz, Mantas Šimkus, Giorgio Stefanoni

Publication date 28 November 2013

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.0575

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Abstract: 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.

Recommendations

• Computing and explaining query answers over inconsistent DL-Lite knowledge bases
• scientific article; zbMATH DE number 7368419
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• The DL-Lite Family and Relations
• ABox abduction in the description logic \(\mathcal{ALC}\)

Cited in

(6)

• Computing and explaining query answers over inconsistent DL-Lite knowledge bases
• Query answering over inconsistent knowledge bases: a probabilistic approach
• scientific article; zbMATH DE number 5136285 (Why is no real title available?)
• Ontology-Mediated Query Answering with Data-Tractable Description Logics
• Connection-minimal abduction in \(\mathcal{EL}\) via translation to FOL
• Data repair of inconsistent nonmonotonic description logic programs

This page was built for publication: Reasoning about explanations for negative query answers in \textit{DL-Lite}

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