A Propositional Logical Encoding of Enriched Interactions in Abstract Argumentation Graphs

Claudette Cayrol (1) , Luis Fariñas del Cerro (2, 3) , Marie-Christine Lagasquie-Schiex (1)

1 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage
2 IRIT-LILaC - Logique, Interaction, Langue et Calcul
3 CNRS - Centre National de la Recherche Scientifique

This chapter aims at providing logical encodings for translating interactions in an argumentation graph themselves into propositional knowledge bases. This translation will be used for identifying or redefining some properties of argumentation graphs. The graphs we consider are used to formalize abstract argumentation with at least two different kinds of interaction (attack and support) and also recursive interactions.

Mots clés: Abstract argumentation; Higher-order interactions; Logical encoding; Propositional logic

Domaines: Informatique [cs]

Claudette Cayrol, Luis Fariñas del Cerro, Marie-Christine Lagasquie-Schiex. A Propositional Logical Encoding of Enriched Interactions in Abstract Argumentation Graphs. Golinska-Pilarek, Joanna; Zawidzki, Michal. Ewa Orłowska on Relational Methods in Logic and Computer Science, 17, Springer, pp.481--502, 2018, OCTR : Outstanding Contributions to Logic, 10.1007/978-3-319-97879-6_18. ⟨10.1007/978-3-319-97879-6_18⟩. ⟨hal-03044257⟩