Non Defeated-Based Repair in Possibilistic DL-Lite Knowledge Bases

Abstract

Possibilistic DL-Lite is an extension of the DL-Lite framework to deal with uncertain pieces of information. In this paper, we deal with inconsistency in DL-Lite in case where the assertions are uncertain and encoded in a possibility theory framework. We investigate three inconsistency-tolerant reasoning methods for possibilistic DL-Lite knowledge bases which are based on the selection of one consistent assertional base. We show that the three possibilistic assertional-based repairs are achieved in a polynomial time.

Extracted Key Phrases

1 Figure or Table

Cite this paper

@inproceedings{Benferhat2015NonDR, title={Non Defeated-Based Repair in Possibilistic DL-Lite Knowledge Bases}, author={Salem Benferhat and Zied Bouraoui and Karim Tabia}, booktitle={FLAIRS Conference}, year={2015} }