An optimal k-consistency algorithm
Artificial Intelligence
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Theoretical Computer Science
Answer set programming and plan generation
Artificial Intelligence
A Reasoning Model Based on the Production of Acceptable Arguments
Annals of Mathematics and Artificial Intelligence
Preferred Arguments are Harder to Compute than Stable Extension
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
A Comparison between SAT and CSP Techniques
Constraints
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Computing ideal sceptical argumentation
Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Inconsistency tolerance in weighted argument systems
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Argumentation in Artificial Intelligence
Argumentation in Artificial Intelligence
Qualitative CSP, finite CSP, and SAT: comparing methods for qualitative constraint-based reasoning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Dialectical Proofs for Constrained Argumentation
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
A Common Computational Framework for Semiring-based Argumentation Systems
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Generating possible intentions with constrained argumentation systems
International Journal of Approximate Reasoning
Hi-index | 0.00 |
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.