An Algorithm for Computing All Minimal Inconsistent Subsets in Description Logic
2017-06-30 12:06:00   来源：   评论：0 点击：

Abstract—This paper investigates the problem of computing all maximal contractions of a given ontology (set of ABox and TBox axioms) with respect to a consistent set of ABox axioms in description logics. Based on this concept of minimal inconsistent subsets which was introduced in our previous paper, an algorithm for computing all minimal inconsistent subsets of a given ontology is proposed. Then all maximal contractions can be computed by using the R-subtraction algorithm which was also proposed in our previous paper.

Index Terms—description logic, maximal contractions, minimal inconsistent subsets, R-Calculus

Cite: Liang Dong, Jie Luo, and Huiyuan Xie, "An Algorithm for Computing All Minimal Inconsistent Subsets in Description Logic," Lecture Notes on Information Theory, Vol. 5, No. 1, pp. 34-38, June 2017. doi: 10.18178/lnit.5.1.34-38