Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases - ANR - Agence nationale de la recherche Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases

Résumé

Several inconsistency-tolerant semantics have been introduced for querying inconsistent description logic knowledge bases. This paper addresses the problem of explaining why a tuple is a (non-)answer to a query under such semantics. We define explanations for positive and negative answers under the brave, AR and IAR semantics. We then study the computational properties of explanations in the lightweight description logic DL-LiteR. For each type of explanation, we analyze the data complexity of recognizing (preferred) explanations and deciding if a given assertion is relevant or necessary. We establish tight connections between intractable explanation problems and variants of propositional satisfiabil-ity (SAT), enabling us to generate explanations by exploiting solvers for Boolean satisfaction and optimization problems. Finally, we empirically study the efficiency of our explanation framework using the well-established LUBM benchmark.
Fichier principal
Vignette du fichier
bienvenu-bourgaux.pdf (377.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01277086 , version 1 (22-02-2016)

Identifiants

  • HAL Id : hal-01277086 , version 1

Citer

Meghyn Bienvenu, Camille Bourgaux, François Goasdoué. Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases. AAAI Conference on Artificial Intelligence, Feb 2016, Phoenix, United States. ⟨hal-01277086⟩
751 Consultations
178 Téléchargements

Partager

Gmail Facebook X LinkedIn More