Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach
作者： Federico Cerutti , Paul E. Dunne , Massimiliano Giacomin , Mauro Vallati
DOI: 10.1007/978-3-642-54373-9_12
关键词:
摘要: This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation its performances. The is based idea reducing problem computing complete to SAT then using depth-first search method derive extensions. proposed has been tested two distinct solvers compared three state-of-the-art systems extension computation. It turns out that delivers significantly better performances large majority considered cases.
springer.com
hud.ac.uk
core.ac.uk
harvard.edu
sci-hub.st 参考文章(27)
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
Gilles Audemard, Laurent Simon, Predicting learnt clauses quality in modern SAT solvers international joint conference on artificial intelligence. pp. 399- 404 ,(2009)
Francesca Toni, Phan Minh Dung, Paolo Mancarella, A dialectic procedure for sceptical, assumption-based argumentation computational models of argument. pp. 145- 156 ,(2006)
Gerard Vreeswijk, Matthew South, John Fox, Dungine: a Java Dung Reasoner computational models of argument. pp. 360- 368 ,(2008)
Paul E. Dunne, Katie Atkinson, Samer Nofal, On Preferred Extension Enumeration in Abstract Argumentation computational models of argument. pp. 205- 216 ,(2012)
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)
Sylvie Doutre, Jérôme Mengin, Preferred Extensions of Argumentation Frameworks: Query Answering and Computation international joint conference on automated reasoning. pp. 272- 288 ,(2001) , 10.1007/3-540-45744-5_20
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
Stefano Bistarelli, Francesco Santini, Modeling and Solving AFs with a Constraint-Based Tool: ConArg Theorie and Applications of Formal Argumentation. ,vol. 7132, pp. 99- 116 ,(2012) , 10.1007/978-3-642-29184-5_7
Paul E. Dunne, Michael Wooldridge, Complexity of Abstract Argumentation Applied Artificial Intelligence. pp. 85- 104 ,(2009) , 10.1007/978-0-387-98197-0_5