Proceedings Abstracts of the Twenty-Fifth International Joint Conference on Artificial Intelligence

Non-Objection Inference for Inconsistency-Tolerant Query Answering / 3684
Salem Benferhat, Zied Bouraoui, Madalina Croitoru, Odile Papini, Karim Tabia

Repair based techniques are a standard way of dealing 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.