Institutional Repository
| A tractable approach to ABox abduction over description logic ontologies | |
| Du, Jianfeng (1); Wang, Kewen (2); Shen, Yi-Dong (3); Du, Jianfeng | |
| 2014 | |
| Conference Name | 28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014 |
| Pages | 1034-1040 |
| Conference Date | July 27, 2014 - July 31, 2014 |
| Conference Place | Quebec City, QC, Canada |
| Indexed Type | EI |
| Publish Place | AI Access Foundation |
| ISBN | 9781577356783 |
| Department | (1) Guangdong University of Foreign Studies, Guangzhou, China; (2) Griffith University, Brisbane; QLD, Australia; (3) State Key Laboratory Of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China |
| English Abstract | ABox abduction is an important reasoning mechanism for description logic ontologies. It computes all minimal explanations (sets of ABox assertions) whose appending to a consistent ontology enforces the entailment of an observation while keeps the ontology consistent. We focus on practical computation for a general problem of ABox abduction, called the query abduction problem, where an observation is a Boolean conjunctive query and the explanations may contain fresh individuals neither in the ontology nor in the observation. However, in this problem there can be infinitely many minimal explanations. Hence we first identify a class of TBoxes called first-order rewritable TBoxes. It guaran-tees the existence of finitely many minimal explanations and is sufficient for many ontology applications. To reduce the number of explanations that need to be computed, we introduce a special kind of minimal explanations called representative explanations from which all minimal explanations can be retrieved. We develop a tractable method (in data complexity) for computing all representative explanations in a consistent ontology. Experimental results demonstrate that the method is efficient and scalable for ontologies with large ABoxes.; ABox abduction is an important reasoning mechanism for description logic ontologies. It computes all minimal explanations (sets of ABox assertions) whose appending to a consistent ontology enforces the entailment of an observation while keeps the ontology consistent. We focus on practical computation for a general problem of ABox abduction, called the query abduction problem, where an observation is a Boolean conjunctive query and the explanations may contain fresh individuals neither in the ontology nor in the observation. However, in this problem there can be infinitely many minimal explanations. Hence we first identify a class of TBoxes called first-order rewritable TBoxes. It guaran-tees the existence of finitely many minimal explanations and is sufficient for many ontology applications. To reduce the number of explanations that need to be computed, we introduce a special kind of minimal explanations called representative explanations from which all minimal explanations can be retrieved. We develop a tractable method (in data complexity) for computing all representative explanations in a consistent ontology. Experimental results demonstrate that the method is efficient and scalable for ontologies with large ABoxes. |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16600 |
| Collection | 中国科学院软件研究所 |
| Corresponding Author | Du, Jianfeng |
| Recommended Citation GB/T 7714 | Du, Jianfeng ,Wang, Kewen ,Shen, Yi-Dong ,et al. A tractable approach to ABox abduction over description logic ontologies[C]. AI Access Foundation,2014:1034-1040. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment