Argumentation frameworks as constraint satisfaction problems

作者: Leila Amgoud , Caroline Devred

DOI: 10.1007/978-3-642-23963-2_10

关键词: ENCODESemantics (computer science)Argumentation frameworkArgumentation theoryMathematicsDefault reasoningFocus (linguistics)Constraint satisfaction problemEncoding (memory)Theoretical computer science

摘要: This paper studies how to encode the problem of computing extensions an argumentation framework (under a given semantics) as constraint satisfaction (CSP). Such encoding is great importance since it makes possible use very efficient solvers (developed by CSP community) for extensions. We focus on three families frameworks: Dung's abstract framework, its constrained version and preference-based frameworks.

参考文章(36)
Sylvie Doutre, Caroline Devred, Claire Lefèvre, Pascal Nicolas, Dialectical Proofs for Constrained Argumentation computational models of argument. ,vol. 216, pp. 159- 170 ,(2010) , 10.3233/978-1-60750-619-5-159
Hélène Fargier, Thierry Castell, Propositional Satisfaction Problems and Clausal CSPs. european conference on artificial intelligence. pp. 214- 218 ,(1998)
Sylvie Coste-Marquis, Pierre Marquis, Caroline Devred, Constrained argumentation frameworks principles of knowledge representation and reasoning. pp. 112- 122 ,(2006)
Bernhard Nebel, Francesca Toni, Yannis Dimopoulos, Finding admissible and preferred arguments can be very hard principles of knowledge representation and reasoning. pp. 53- 61 ,(2000)
Bernhard Nebel, Francesca Toni, Yannis Dimopoulos, Preferred Arguments are Harder to Compute than Stable Extension international joint conference on artificial intelligence. pp. 36- 43 ,(1999)
Mohamed Mbarki, Jamal Bentahar, Bernard Moulin, Specification and Complexity of Strategic-Based Reasoning Using Argumentation Lecture Notes in Computer Science. pp. 142- 160 ,(2006) , 10.1007/978-3-540-75526-5_9
Uwe Egly, Sarah Alice Gaggl, Stefan Woltran, ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming international conference on logic programming. pp. 734- 738 ,(2008) , 10.1007/978-3-540-89982-2_67
Stefan Wölfl, Matthias Westphal, Qualitative CSP, finite CSP, and SAT: comparing methods for qualitative constraint-based reasoning international joint conference on artificial intelligence. pp. 628- 633 ,(2009)
Paul E. Dunne, Michael Wooldridge, Complexity of Abstract Argumentation Applied Artificial Intelligence. pp. 85- 104 ,(2009) , 10.1007/978-0-387-98197-0_5
Stefano Bistarelli, Francesco Santini, A Common Computational Framework for Semiring-based Argumentation Systems european conference on artificial intelligence. ,vol. 215, pp. 131- 136 ,(2010) , 10.3233/978-1-60750-606-5-131