Non-Objection Inference for Inconsistency-Tolerant Query Answering

Salem Benferhat (1) , Zied Bouraoui (1) , Madalina Croitoru (2) , Odile Papini (3, 4) , Karim Tabia (1)

1 CRIL - Centre de Recherche en Informatique de Lens
2 GRAPHIK - Graphs for Inferences on Knowledge
3 LIS - Laboratoire d'Informatique et Systèmes
4 LIRICA - Logique, Interaction, Raisonnement et Inférence, Complexité, Algèbre

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.

Domains: Computer Science [cs]; Artificial Intelligence [cs.AI]

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⟩