Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence and the Twenty-Third Innovative Applications of Artificial Intelligence Conference, 7-11 August 2011, San Francisco, California, USA |
| Publisher | AAAI Press |
| Pages | 1160-1165 |
| Number of pages | 6 |
| ISBN (Print) | 978-157735509-0 |
| Publication status | Published - 1 Jan 2011 |
| Event | 25th AAAI Conference on Artificial Intelligence and the 23rd Innovative Applications of Artificial Intelligence Conference, AAAI-11 / IAAI-11 - San Francisco, United States Duration: 7 Aug 2011 → 11 Aug 2011 |
Conference
| Conference | 25th AAAI Conference on Artificial Intelligence and the 23rd Innovative Applications of Artificial Intelligence Conference, AAAI-11 / IAAI-11 |
|---|---|
| Country/Territory | United States |
| City | San Francisco |
| Period | 7/08/11 → 11/08/11 |
Keywords
- abductive reasoning
- description logic
- finite time
- minimality
- novel methods