Rational Elimination of DL-Lite TBox Axioms
MetadataShow full item record
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.
Informal Proceedings of the 27th International Workshop on Description Logics
© The Author(s) 2014. The attached file is reproduced here in accordance with the copyright policy of the publisher. For information about this conference please refer to the conference’s website or contact the authors.
Artificial Intelligence and Image Processing not elsewhere classified