Argumentation frameworks as Constraint Satisfaction Problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of Mathematics and Artificial Intelligence Année : 2013

Argumentation frameworks as Constraint Satisfaction Problems

Résumé

Argumentation is a promising approach for defeasible reasoning. It consists of justifying each plausible conclusion by arguments. Since the available information may be inconsistent, a conclusion and its negation may both be justified. The arguments are thus said to be conflicting. The main issue is how to evaluate the arguments. Several semantics were proposed for that purpose. The most important ones are: stable, preferred, complete, grounded and admissible. A semantics is a set of criteria that should be satisfied by a set of arguments, called extension, in order to be acceptable. Different decision problems related to these semantics were defined (like whether an argumentation framework has a stable extension). It was also shown that most of these problems are intractable. Consequently, developing algorithms for these problems is not trivial and thus the implementation of argumentation systems not obvious. Recently, some solutions to this problem were found. The idea is to use a reduction method where a given problem is translated in another one like SAT or ASP. This paper follows this line of research. It studies how to encode the problem of computing the extensions of an argumentation framework (under each of the previous semantics) as a constraint satisfaction problem (CSP). Such encoding is of great importance since it makes it possible to use the very efficient solvers (developed by the CSP community) for computing the extensions. Our encodings take advantage of existing reductions to SAT problems in the case of Dung’s abstract framework. Among the various ways of translating a SAT problem into a CSP one, we propose the most appropriate one in the argumentation context. We also provide encodings in case two other families of argumentation frameworks: the constrained version of Dung’s abstract framework and preference-based argumentation framework.
Fichier non déposé

Dates et versions

hal-04305182 , version 1 (24-11-2023)

Identifiants

Citer

Leila Amgoud, Caroline Devred. Argumentation frameworks as Constraint Satisfaction Problems. Annals of Mathematics and Artificial Intelligence, 2013, 69, pp.131--148. ⟨10.1007/s10472-013-9343-0⟩. ⟨hal-04305182⟩
6 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More