How to Select One Preferred Assertional-Based Repair from Inconsistent and Prioritized DL-Lite Knowledge Bases?
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 1450-1455.
Abstract
Managing inconsistency in DL-Lite knowledge bases where the assertional base is prioritized is a crucial problem in many applications. This is especially true when the assertions are provided by multiple sources having different reliability levels. This paper first reviews existing approaches for selecting preferred repairs. It then focuses on suitable strategies for handling inconsistency in DL-Lite knowledge bases. It proposes new approaches based on the selection of only one preferred repair. These strategies have as a starting point the so-called non-defeated repair and add one of the following principles: deductive closure, consistency, cardinality and priorities. Lastly, we provide a comparative analysis followed by an experimental evaluation of the studied approaches.
@inproceedings{ijcai2015p208,
title = {How to Select One Preferred Assertional-Based Repair from Inconsistent and Prioritized DL-Lite Knowledge Bases?},
author = {Benferhat, Salem and Bouraoui, Zied and Tabia, Karim},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-15}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Qiang Yang and Michael Wooldridge},
pages = {1450--1455},
year = {2015},
month = {7},
note = {Main Track},
url = {https://ijcai.org/proceedings/2015/208},
}
TY - CPAPER TI - How to Select One Preferred Assertional-Based Repair from Inconsistent and Prioritized DL-Lite Knowledge Bases? AU - Benferhat, Salem AU - Bouraoui, Zied AU - Tabia, Karim T2 - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 PB - International Joint Conferences on Artificial Intelligence PY - 2015 SP - 1450 EP - 1455 UR - https://ijcai.org/proceedings/2015/208 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: