Towards Practical ABox Abduction in Large OWL DL Ontologies


  • Jianfeng Du Guangdong University of Foreign Studies
  • Guilin Qi Southeast University
  • Yi-Dong Shen Chinese Academy of Sciences
  • Jeff Pan The University of Aberdeen



ABox abduction is an important aspect for abductive reasoning in Description Logics (DLs). It finds all minimal sets of ABox axioms that should be added to a background ontology to enforce entailment of a specified set of ABox axioms. As far as we know, by now there is only one ABox abduction method in expressive DLs computing abductive solutions with certain minimality. However, the method targets an ABox abduction problem that may have infinitely many abductive solutions and may not output an abductive solution in finite time. Hence, in this paper we propose a new ABox abduction problem which has only finitely many abductive solutions and also propose a novel method to solve it. The method reduces the original problem to an abduction problem in logic programming and solves it with Prolog engines. Experimental results show that the method is able to compute abductive solutions in benchmark OWL DL ontologies with large ABoxes.




How to Cite

Du, J., Qi, G., Shen, Y.-D., & Pan, J. (2011). Towards Practical ABox Abduction in Large OWL DL Ontologies. Proceedings of the AAAI Conference on Artificial Intelligence, 25(1), 1160-1165.