Non-Objection Inference for Inconsistency-Tolerant Query Answering
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 3684-3689.
Abstract
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.
@inproceedings{ijcai2016p518,
title = {Non-Objection Inference for Inconsistency-Tolerant Query Answering},
author = {Benferhat, Salem and Bouraoui, Zied and Croitoru, Madalina and Papini, Odile and Tabia, Karim},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {3684--3689},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/518},
}
TY - CPAPER TI - Non-Objection Inference for Inconsistency-Tolerant Query Answering AU - Benferhat, Salem AU - Bouraoui, Zied AU - Croitoru, Madalina AU - Papini, Odile AU - Tabia, Karim T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 3684 EP - 3689 UR - https://ijcai.org/proceedings/2016/518 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: