Towards Practical ABox Abduction in Large Description Logic Ontologies
Towards Practical ABox Abduction in Large Description Logic Ontologies
复制标题
DOI：
10.4018/jswis.2012040101
复制
发表时间：
2012-04
期刊：
影响因子：
--
通讯作者：
Jianfeng Du;G. Qi;Yi-Dong Shen;Jeff Z. Pan
中科院分区：
文献类型：
--
作者：
Jianfeng Du;G. Qi;Yi-Dong Shen;Jeff Z. Pan
ABox溯因是描述逻辑dsl中一种重要的推理工具。它找到ABox公理的所有最小集合，称为溯因解，它应该被添加到背景本体中，以强制蕴涵一个观测值，这是一个特定的ABox公理集。然而，由于缺乏在有限时间内工作的表达性dl的可行方法，ABox溯因目前还远未实现。本文提出了ABox溯因问题的一个新问题和相应溯因解的计算新方法，为实际应用ABox溯因奠定了基础。所提出的问题保证有有限个数的溯因解。所提出的方法在有限的时间内适用于非常富有表现力的DL，它支持W3C标准语言owl2，并保证计算结果的可靠性和条件完整性。在基准本体上的实验结果表明，该方法是可行的，可以扩展到大型箱体。
ABox abduction is an important reasoning facility in Description Logics DLs. It finds all minimal sets of ABox axioms, called abductive solutions, which should be added to a background ontology to enforce entailment of an observation which is a specified set of ABox axioms. However, ABox abduction is far from practical by now because there lack feasible methods working in finite time for expressive DLs. To pave a way to practical ABox abduction, this paper proposes a new problem for ABox abduction and a new method for computing abductive solutions accordingly. The proposed problem guarantees finite number of abductive solutions. The proposed method works in finite time for a very expressive DL,, which underpins the W3C standard language OWL 2, and guarantees soundness and conditional completeness of computed results. Experimental results on benchmark ontologies show that the method is feasible and can scale to large ABoxes.