Towards Practical ABox Abduction in Large Description Logic Ontologies

Jianfeng Du, Guilin Qi, Yi-Dong Shen, Jeff Z Pan

Research output: Contribution to journalArticle

13 Citations (Scopus)

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, , 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.
Original languageEnglish
Article number1
Number of pages33
JournalInternational Journal on Semantic Web and Information Systems (IJSWIS)
Volume8
Issue number2
DOIs
Publication statusPublished - 2012

Fingerprint

Ontology

Cite this

Towards Practical ABox Abduction in Large Description Logic Ontologies. / Du, Jianfeng ; Qi, Guilin ; Shen, Yi-Dong ; Pan, Jeff Z.

In: International Journal on Semantic Web and Information Systems (IJSWIS), Vol. 8, No. 2, 1, 2012.

Research output: Contribution to journalArticle

@article{14524f58b8964b729d214b5d875ed6fa,
title = "Towards Practical ABox Abduction in Large Description Logic Ontologies",
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, , 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.",
author = "Jianfeng Du and Guilin Qi and Yi-Dong Shen and Pan, {Jeff Z}",
year = "2012",
doi = "10.4018/jswis.2012040101",
language = "English",
volume = "8",
journal = "International Journal on Semantic Web and Information Systems (IJSWIS)",
issn = "1552-6283",
publisher = "IGI Publishing",
number = "2",

}

TY - JOUR

T1 - Towards Practical ABox Abduction in Large Description Logic Ontologies

AU - Du, Jianfeng

AU - Qi, Guilin

AU - Shen, Yi-Dong

AU - Pan, Jeff Z

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

U2 - 10.4018/jswis.2012040101

DO - 10.4018/jswis.2012040101

M3 - Article

VL - 8

JO - International Journal on Semantic Web and Information Systems (IJSWIS)

JF - International Journal on Semantic Web and Information Systems (IJSWIS)

SN - 1552-6283

IS - 2

M1 - 1

ER -