Query-Driven Repairing of Inconsistent DL-Lite Knowledge Bases

Meghyn Bienvenu 1 Camille Bourgaux 2 François Goasdoué 3
1 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
3 SHAMAN - Symbolic and Human-centric view of dAta MANagement
IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
Abstract : We consider the problem of query-driven repairing of inconsistent DL-Lite knowledge bases: query answers are computed under inconsistency-tolerant semantics, and the user provides feedback about which answers are erroneous or missing. The aim is to find a set of ABox modifications (deletions and additions), called a repair plan, that addresses as many of the defects as possible. After formalizing this problem and introducing different notions of optimality, we investigate the computational complexity of reasoning about optimal repair plans and propose interactive algorithms for computing such plans. For deletion-only repair plans, we also present a prototype implementation of the core components of the algorithm.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01367864
Contributor : Meghyn Bienvenu <>
Submitted on : Friday, September 16, 2016 - 7:53:43 PM
Last modification on : Wednesday, March 13, 2019 - 5:22:02 PM
Long-term archiving on : Saturday, December 17, 2016 - 2:20:00 PM

File

BieBouGoa-IJCAI16.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-01367864, version 1

Citation

Meghyn Bienvenu, Camille Bourgaux, François Goasdoué. Query-Driven Repairing of Inconsistent DL-Lite Knowledge Bases. IJCAI: International Joint Conference on Artificial Intelligence, Jul 2016, New York, United States. ⟨lirmm-01367864⟩

Share

Metrics

Record views

462

Files downloads

548