Rules and meta-rules in possibility theory. From possibilistic logic to answer-set programming

Publication Type:
Journal Article
Revue d'Intelligence Artificielle, 2012, 26 (1-2), pp. 63 - 83
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
DocumentOpener.pdfPublished Version1.81 MB
Adobe PDF
The modeling of conditional/implicative rules of the form "if A then B" plays a crucial role in any attempt at formalizing reasoning. Starting from the expression of different forms of rules that have been identified in the setting of possibility theory, we study their counterparts in the framework of extensions of possibilistic logic. A distinction between rules and meta-rules is especially emphasized. The former contribute to the partial specification of a unique epistemic state, while the latter relate partially specified epistemic states, as in Answer Set Programming (ASP). The contribution of Pascal Nicolas to bridging the gap between possibilistic logic and ASP is discussed in this perspective. © 2012 Lavoisier.
Please use this identifier to cite or link to this item: