Argumentation Frameworks with Higher-Order Attacks: Labellings and Complexity

Sylvie Doutre (1, 2) , Mickaël Lafages (3, 4) , Marie-Christine Lagasquie-Schiex (3, 4)

1 IRIT-LILaC - Logique, Interaction, Langue et Calcul
2 UT Capitole - Université Toulouse Capitole
3 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage
4 UT3 - Université Toulouse III - Paul Sabatier

Computation and decision problems related to argumentation frameworks with higher-order attacks have not received a lot of attention so far. This paper is a step towards these issues: first, it provides a labelling counterpart for the structure semantics of Recursive Argumentation Frameworks (RAF); second, it investigates the complexity of decision problems associated with RAF. This investigation shows that, for the higher expressiveness offered by these enriched systems, the complexity is the same as for classical argumentation frameworks. As a side contribution, a new semantics for RAF, the semi-stable semantics, and a new process for translating RAF into Argumentation Frameworks without higher-order attacks (AF), are introduced.

Mots clés: abstract argumentation framework; higherorder attacks; complexity

Domaines: Intelligence artificielle [cs.AI]

Sylvie Doutre, Mickaël Lafages, Marie-Christine Lagasquie-Schiex. Argumentation Frameworks with Higher-Order Attacks: Labellings and Complexity. 32nd International Conference on Tools with Artificial Intelligence (ICTAI 2020), IEEE, Nov 2020, Chicago (virtual conference), United States. pp.1210-1217, ⟨10.1109/ICTAI50040.2020.00183⟩. ⟨hal-03009866⟩