Abstract solvers for Dung’s argumentation frameworks
作者： Remi Brochenin , Thomas Linsbichler , Marco Maratea , Johannes P. Wallner , Stefan Woltran
DOI: 10.3233/AAC-170031
关键词:
摘要: Abstract solvers are a quite recent method to uniformly describe algorithms in rigorous formal way and have proven successful declarative paradigms such as Propositional Satisfiability Answer Set Programming. In this paper, we apply machinery for the first time dedicated AI formalism, namely Dung’s abstract argumentation frameworks. We provide descriptions of several advanced preferred semantics terms and, moreover, show how slight adaptions thereof directly lead new algorithms.
medra.org 参考文章(50)
Sanjay Modgil, Martin Caminada, Proof Theories and Algorithms for Abstract Argumentation Frameworks Applied Artificial Intelligence. pp. 105- 129 ,(2009) , 10.1007/978-0-387-98197-0_6
Mauro Vallati, Massimiliano Giacomin, Federico Cerutti, Federico Cerutti, Algorithm selection for preferred extensions enumeration computational models of argument. pp. 221- 232 ,(2014) , 10.3233/978-1-61499-436-7-221
Mauro Vallati, Nir Oren, Matthias Thimm, Hannes Strass, Federico Cerutti, Federico Cerutti, A Benchmark Framework for a Computational Argumentation Competition computational models of argument. pp. 459- 460 ,(2014) , 10.3233/978-1-61499-436-7-459
Mauro Vallati, Massimiliano Giacomin, Federico Cerutti, Federico Cerutti, ArgSemSAT : Solving argumentation problems using SAT computational models of argument. pp. 455- 456 ,(2014) , 10.3233/978-1-61499-436-7-455
Roberto Sebastiani, Lazy Satisfiability Modulo Theories Journal on Satisfiability, Boolean Modeling and Computation. ,vol. 3, pp. 141- 224 ,(2007) , 10.3233/SAT190034
Mauro Vallati, Massimiliano Giacomin, Marina Zanella, Federico Cerutti, A SCC recursive meta-algorithm for computing preferred labellings in abstract argumentation principles of knowledge representation and reasoning. pp. 42- 51 ,(2014)
Ringo Baumann, Christof Spanring, Infinite Argumentation Frameworks Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday on Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation - Volume 9060. pp. 281- 295 ,(2014) , 10.1007/978-3-319-14726-0_19
Marco Maratea, Yuliya Lierler, Remi Brochenin, Abstract disjunctive answer set solvers european conference on artificial intelligence. pp. 165- 170 ,(2014) , 10.3233/978-1-61499-419-0-165
Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin, Mauro Vallati, Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach Theory and Applications of Formal Argumentation. pp. 176- 193 ,(2014) , 10.1007/978-3-642-54373-9_12
Bart Verheij, Two Approaches to Dialectical Argumentation: Admissible Sets and Argumentation Stages ,(1999)