A Dynamic Logic Framework for Abstract Argumentation (CAF 2016) - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

A Dynamic Logic Framework for Abstract Argumentation (CAF 2016)

Résumé

We provide a logical analysis of abstract argumentation frameworks and their dynamics. Following previous work by several authors, we express attack relation and argument status by means of propositional variables and define acceptability criteria by formulas of propositional logic. We here study the dynamics of argumentation frameworks in terms of basic operations on these propositional variables, viz. change of their truth values. We describe these operations in a uniform way within a well-known variant of Propositional Dynamic Logic PDL: the Dynamic Logic of Propositional Assignments, DL-PA. The atomic programs of DL-PA are assignments of propositional variables to truth values, and complex programs can be built by means of the connectives of sequential and nondeterministic composition and test. We start by showing that in DL-PA, the construction of extensions can be performed by a DL-PA program that is parametrized by the definition of acceptance. We then mainly focus on how the acceptance of one or more arguments can be enforced and show that this can be achieved by changing the truth values of the propositional variables describing the attack relation in a minimal way.
Fichier non déposé

Dates et versions

hal-03165003 , version 1 (10-03-2021)

Identifiants

  • HAL Id : hal-03165003 , version 1

Citer

Sylvie Doutre, Andreas Herzig, Laurent Perrussel. A Dynamic Logic Framework for Abstract Argumentation (CAF 2016). Cardiff Argumentation Forum (CAF 2016), Federico Cerutti (School of Computer Science & Informatis at Cardiff University); Francesca Toni (Department of Computing at Imperial College London), Jul 2016, Cardiff, United States. ⟨hal-03165003⟩
23 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More