Inconsistency Handling for Partially Preordered Ontologies: Going Beyond Elect

We continue investigations into computing repairs for an inconsistent Description Logic (DL) knowledge base (KB). In recent work, a tractable method, called Elect, has been introduced to restore consistency of the ABox w.r.t. the TBox. Elect deals with the case of KBs expressed in DL-Lite and when a partial preorder is applied to the ABox. It has been shown that Elect generalizes the well-known IAR semantics when no priority relation over the ABox is used, and the so-called non-defeated semantics when the relation is a total preorder. In the present paper, we propose two extensions of Elect. First, we redefine Elect by using a preference-based semantics from the literature but with the drawback of losing tractability. Second, we show under which conditions Elect can be generalized to DLs that are more expressive than DL-Lite.