Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Non-Objection Inference for Inconsistency-Tolerant Query Answering

Salem Benferhat 1 Zied Bouraoui 1 Madalina Croitoru 2 Odile Papini 3, 4 Karim Tabia 1 
2 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
Abstract : Repair based techniques are a standard way of deal- ing with inconsistency in the context of ontology based data access. We propose a novel non-objection inference relation (along with its variants) where a query is considered as valid if it follows from at least one repair and it is consistent with all the repairs. These inferences are strictly more productive than universal inference while preserving the consistency of its set of conclusions. We study the productivity and properties of the new inferences. We also give experimental results of the proposed non-objection inference.
Document type :
Conference papers
Complete list of metadata
Contributor : Fabien DELORME Connect in order to contact the contributor
Submitted on : Wednesday, July 28, 2021 - 11:12:14 AM
Last modification on : Tuesday, July 5, 2022 - 10:00:58 AM
Long-term archiving on: : Friday, October 29, 2021 - 6:48:21 PM


Publisher files allowed on an open archive


  • HAL Id : hal-03299707, version 1


Salem Benferhat, Zied Bouraoui, Madalina Croitoru, Odile Papini, Karim Tabia. Non-Objection Inference for Inconsistency-Tolerant Query Answering. 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), Jul 2016, New York, United States. pp.3684-3690. ⟨hal-03299707⟩



Record views


Files downloads