AAAI Publications, The Twenty-Eighth International Flairs Conference

Font Size: 
Non Defeated-Based Repair in Possibilistic DL-Lite Knowledge Bases
Salem Benferhat, Zied Bouraoui, Karim Tabia

Last modified: 2015-04-07

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.

Full Text: PDF