Translation of an argumentation framework into a CP-boolean game (ICTAI 2009)

Elise Bonzon (1, 2) , Caroline Devred (3) , Marie-Christine Lagasquie-Schiex (4)

1 LIPADE (URP_2517) - Laboratoire d'Informatique Paris Descartes
2 CRIP5 - EA 2517 - Centre de Recherche en Informatique de Paris 5
3 LERIA - Laboratoire d'Etudes et de Recherche en Informatique d'Angers
4 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage

There already exist some links between argumentation and game theory. For instance, dynamic games can be used for simulating interactions between agents in an argumentation process. In this paper, we establish a new link between these domains in a static framework: we show how an argumentation framework can be translated into a CP-Boolean game and how this translation can be used for computing extensions of argumentation semantics. We give formal algorithms to do so.

Mots clés: AI and games; Knowledge representation and reasoning; Argumentation; Abstracts; Polynomials

Domaines: Intelligence artificielle [cs.AI]

Elise Bonzon, Caroline Devred, Marie-Christine Lagasquie-Schiex. Translation of an argumentation framework into a CP-boolean game (ICTAI 2009). 21st International Conference on Tools with Artificial Intelligence (ICTAI 2009), IEEE, Nov 2009, Newark, New Jersey, United States. pp.522-529. ⟨hal-02875423⟩