Abstract
An essential task in managing description logic (DL) ontologies is the elimination of problematic axioms. Such elimination is formalised as the operation of contraction in belief change. In this paper, we investigate contraction over DL-LiteR TBoxes. In belief change, a well known approach for defining contraction is via epistemic entrenchments which are preference orderings over formulas. The approach however is not applicable in DL-LiteR as classic belief change assumes an underlying logic that is different from DL-LiteR. Thus we reformulate the epistemic entrenchment approach to make it applicable to DL-LiteR.We then provide instantiation for the reformulated approach.
| Language | English |
|---|---|
| Pages | 746-756 |
| Number of pages | 11 |
| Journal | CEUR Workshop Proceedings |
| Volume | 1193 |
| Publication status | Published - 2014 |
Fingerprint
Cite this
}
Rational elimination of DL-Lite TBox axioms. / Zhuang, Zhiqiang; Wang, Zhe; Wang, Kewen; Antoniou, Grigoris.
In: CEUR Workshop Proceedings, Vol. 1193, 2014, p. 746-756.Research output: Contribution to journal › Article
TY - JOUR
T1 - Rational elimination of DL-Lite TBox axioms
AU - Zhuang, Zhiqiang
AU - Wang, Zhe
AU - Wang, Kewen
AU - Antoniou, Grigoris
PY - 2014
Y1 - 2014
N2 - An essential task in managing description logic (DL) ontologies is the elimination of problematic axioms. Such elimination is formalised as the operation of contraction in belief change. In this paper, we investigate contraction over DL-LiteR TBoxes. In belief change, a well known approach for defining contraction is via epistemic entrenchments which are preference orderings over formulas. The approach however is not applicable in DL-LiteR as classic belief change assumes an underlying logic that is different from DL-LiteR. Thus we reformulate the epistemic entrenchment approach to make it applicable to DL-LiteR.We then provide instantiation for the reformulated approach.
AB - An essential task in managing description logic (DL) ontologies is the elimination of problematic axioms. Such elimination is formalised as the operation of contraction in belief change. In this paper, we investigate contraction over DL-LiteR TBoxes. In belief change, a well known approach for defining contraction is via epistemic entrenchments which are preference orderings over formulas. The approach however is not applicable in DL-LiteR as classic belief change assumes an underlying logic that is different from DL-LiteR. Thus we reformulate the epistemic entrenchment approach to make it applicable to DL-LiteR.We then provide instantiation for the reformulated approach.
UR - http://www.scopus.com/inward/record.url?scp=84992609436&partnerID=8YFLogxK
M3 - Article
VL - 1193
SP - 746
EP - 756
JO - CEUR Workshop Proceedings
T2 - CEUR Workshop Proceedings
JF - CEUR Workshop Proceedings
SN - 1613-0073
ER -