Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics (Extended Abstract)
Abstract
Many inconsistency-tolerant semantics for DLs rely on the notion of a repair, i.e., a ⊆-maximal subset of the ABox that is consistent with the TBox. This extended abstract presents our investigation of variants of two popular inconsistency-tolerant semantics obtained by replacing classical repairs by various types of preferred repair.