Possibilistic Reasoning About Actions in Agent Systems

In reasoning about games, we can understand players' behaviors according to their belief, action, and preference. While modal logic can be easily used to represent and reason about agents' beliefs and knowledge if we adopt an epistemic reading of modal operators, reasoning about action requires the extension of modalities. Dynamic logic is one of the earliest attempt along this direction. The original motivation of dynamic logic is to reason about program. However, it can be applied to any structural set of actions. In this paper, we propose a graded propositional dynamic logic (gPDL) for possibilistic reasoning about regular program.