A possibilistic analysis of inconsistency

Publisher:
SpringerLink
Publication Type:
Conference Proceeding
Citation:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015, 9310 pp. 347 - 353
Issue Date:
2015-09-16
Full metadata record
Files in This Item:
Filename Description Size
dubois_15485.pdfAccepted Manuscript77.34 kB
Adobe PDF
© Springer International Publishing Switzerland 2015. Central in standard possibilistic logic (where propositional logic formulas are associated with lower bounds of their necessity measures), is the notion of inconsistency level of a possibilistic logic base. Formulas whose level is strictly above this inconsistency level constitute a sub-base free of any inconsistency. Some extensions, based on the notions of paraconsistent completion of a possibilistic logic base, and of safely supported formulas, have been proposed for handling formulas below the level of inconsistency. In this paper we further explore these ideas, and show the interest of considering the minimal inconsistent subsets in this setting. Lines for further research are also outlined.
Please use this identifier to cite or link to this item: