Reasoning about explanations for negative query answers in DL-lite

被引：0

作者：

机构：

[1] Calvanese, Diego

[2] Ortiz, Magdalena

[3] Šimkus, Mantas

[4] Stefanoni, Giorgio

来源：

| 1600年 / AI Access Foundation卷 / 48期

关键词：

In order to meet usability requirements; most logic-based applications provide explana- tion 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 answer- ing. 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 conjunc- tive 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. © 2013 AI Access Foundation;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Journal article (JA)

引用