Credulous Acceptability, Poison Games and Modal Logic

by   Davide, et al.

The Poison Game is a two-player game played on a graph in which one player can influence which edges the other player is able to traverse. It operationalizes the notion of existence of credulously admissible sets in an argumentation framework or, in graph-theoretic terminology, the existence of non-trivial semi-kernels. We develop a modal logic (poison modal logic, PML) tailored to represent winning positions in such a game, thereby identifying the precise modal reasoning that underlies the notion of credulous admissibility in argumentation. We study model-theoretic and decidability properties of PML, and position it with respect to recently studied logics at the cross-road of modal logic, argumentation, and graph games.


page 1

page 2

page 3

page 4


Formula size games for modal logic and μ-calculus

We propose a new version of formula size game for modal logic. The game ...

On the existence and multiplicity of extensions in dialectical argumentation

In the present paper, the existence and multiplicity problems of extensi...

Losing Connection:the Modal Logic of Definable Link Deletion

In this article, we start with a two-player game that models communicati...

A New Game Equivalence and its Modal Logic

We revisit the crucial issue of natural game equivalences, and semantics...

Value-based Practical Reasoning: Modal Logic + Argumentation

Autonomous agents are supposed to be able to finish tasks or achieve goa...

On Games and Computation

We introduce and investigate a range of general notions of a game. Our p...