Identifying the core of logic-based argumentation systems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Identifying the core of logic-based argumentation systems

Résumé

We are interested by argumentation systems which build their arguments from a propositional knowledge base (KB), and evaluate them using Dung's acceptability semantics. We start by showing that such systems are infinite, i.e. from a finite KB, an infinite set of arguments and an infinite set of attacks among them are generated. While the construction of arguments under propositional logic is costly even in the finite case, the fact that those systems are infinite makes them completely useless. Then, we provide a procedure which, given an argumentation system, computes its finite sub-system, called core. A core considers a finite subset of arguments and a finite subset of attacks, and returns all the results of the original system. This means that a finite subset of arguments is sufficient to draw all the expected conclusions from a KB.
Fichier principal
Vignette du fichier
PID2062121.pdf (105.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04305198 , version 1 (29-11-2023)

Identifiants

Citer

Leila Amgoud, Philippe Besnard, Srdjan Vesic. Identifying the core of logic-based argumentation systems. 23rd IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2023), Nov 2011, Boca Raton, Florida, United States. pp.633--636, ⟨10.1109/ICTAI.2011.100⟩. ⟨hal-04305198⟩
26 Consultations
14 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More