Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics (Extended Abstract)

Meghyn Bienvenu (1) , Camille Bourgaux (2) , François Goasdoué (3)

1 LaHDAK - LRI - Données et Connaissances Massives et Hétérogènes (LRI)
2 LRI - Laboratoire de Recherche en Informatique
3 PILGRIM - Gradedness, Imprecision, and Mediation in Database Management Systems

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.

Domaines: Intelligence artificielle [cs.AI]; Base de données [cs.DB]

Meghyn Bienvenu, Camille Bourgaux, François Goasdoué. Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics (Extended Abstract). International Workshop on Description Logics, Jul 2014, Vienna, Austria. ⟨hal-01052452⟩