Reasoning about uncertainty and explicit ignorance in generalized possibilistic logic

Publication Type:
Conference Proceeding
Frontiers in Artificial Intelligence and Applications, 2014, 263 pp. 261 - 266
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
hen.pdfPublished version234.74 kB
Adobe PDF
© 2014 The Authors and IOS Press. Generalized possibilistic logic (GPL) is a logic for reasoning about the revealed beliefs of another agent. It is a two-tier propositional logic, in which propositional formulas are encapsulated by modal operators that are interpreted in terms of uncertainty measures from possibility theory. Models of a GPL theory represent weighted epistemic states and are encoded as possibility distributions. One of the main features of GPL is that it allows us to explicitly reason about the ignorance of another agent. In this paper, we study two types of approaches for reasoning about ignorance in GPL, based on the idea of minimal specificity and on the notion of guaranteed possibility, respectively. We show how these approaches naturally lead to different flavours of the language of GPL and a number of decision problems, whose complexity ranges from the first to the third level of the polynomial hierarchy.
Please use this identifier to cite or link to this item: