Rational elimination of DL-Lite TBox axioms

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-Lite_R 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-Lite_R as classic belief change assumes an underlying logic that is different from DL-Lite_R. Thus we reformulate the epistemic entrenchment approach to make it applicable to DL-Lite_R.We then provide instantiation for the reformulated approach.