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.
|Number of pages||33|
|Journal||International Journal on Semantic Web and Information Systems (IJSWIS)|
|Publication status||Published - 2012|
Du, J., Qi, G., Shen, Y-D., & Pan, J. Z. (2012). Towards Practical ABox Abduction in Large Description Logic Ontologies. International Journal on Semantic Web and Information Systems (IJSWIS), 8(2), . https://doi.org/10.4018/jswis.2012040101