Computing the Labellings of Higher-Order Abstract Argumentation Frameworks - Université Toulouse III - Paul Sabatier - Toulouse INP Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Computing the Labellings of Higher-Order Abstract Argumentation Frameworks

Résumé

The topic of this work is related to a computational issue concerning an enriched abstract argumentation framework called RAF (“Recursive Argumentation Framework”). A RAF is composed of a set of arguments and a binary relation modelling the attacks as in Dung’s framework. The main difference between Dung’s framework and a RAF is the fact that a RAF is able to take into account higher-order interactions (i.e. an attack can target an attack and not only an argument). Since this kind of framework is relatively recent, the efficient computation of the main semantics remains an open question. In this paper, we propose one of the first algorithms dedicated to this issue. We prove the soundness and completeness of this algorithm.
Fichier principal
Vignette du fichier
paper4.pdf (987.99 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03812167 , version 1 (12-10-2022)

Licence

Paternité

Identifiants

  • HAL Id : hal-03812167 , version 1

Citer

Sylvie Doutre, Marie-Christine Lagasquie-Schiex. Computing the Labellings of Higher-Order Abstract Argumentation Frameworks. 4th International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2022), Sep 2022, Cardiff, United Kingdom. pp.45-58. ⟨hal-03812167⟩
52 Consultations
36 Téléchargements

Partager

Gmail Facebook X LinkedIn More