Title: towards practical abox abduction in large description logic ontologies
Author: Du Jianfeng
; Qi Guilin
; Shen Yi-Dong
; Pan Jeff Z.
Keyword: Formal languages
; Logic programming
; Ontology
Source: International Journal on Semantic Web and Information Systems
Issued Date: 2012
Volume: 8, Issue: 2, Pages: 1-33 Indexed Type: EI
Department: (1) Guangdong University of Foreign Studies State Key Laboratory of Computer Science Institute of Software China; (2) Southeast University Key Laboratory of Symbolic Computation Jilin University Jilin China; (3) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China; (4) University of Aberdeen Aberdeen United Kingdom
Abstract: 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, SHOIQ, 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. Copyright © 2012, IGI Global. English Abstract: 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, SHOIQ, 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. Copyright © 2012, IGI Global. Language: 英语
WOS ID: WOS:000312931500001
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/15167
Appears in Collections: 软件所图书馆_期刊论文
There are no files associated with this item.
Recommended Citation:
Du Jianfeng,Qi Guilin,Shen Yi-Dong,et al. towards practical abox abduction in large description logic ontologies[J]. International Journal on Semantic Web and Information Systems,2012-01-01,8(2):1-33.
