The first international competition on computational models of argumentation: Results and analysis

We report on the First International Competition on Computational Models of Argumentation (ICCMA'15) which took place in the first half of 2015 and focused on reasoning tasks in abstract argumentation frameworks. Performance of submitted solvers was evaluated on four computational problems wrt. four different semantics relating to the verification of the acceptance status of arguments, and computing jointly acceptable sets of arguments. In this paper, we describe the technical setup of the competition, and give an overview on the submitted solvers. Moreover, we report on the results and discuss our findings.

[1]  Martin Caminada,et al.  On the Issue of Reinstatement in Argumentation , 2006, JELIA.

[2]  Serena Villata,et al.  A Support Framework for Argumentative Discussions Management in the Web , 2013, ESWC.

[3]  Sanjay Modgil,et al.  Proof Theories and Algorithms for Abstract Argumentation Frameworks , 2009, Argumentation in Artificial Intelligence.

[4]  Stefan Woltran,et al.  Answer-set programming encodings for argumentation frameworks , 2010, Argument Comput..

[5]  Stefan Woltran,et al.  Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems , 2011, INAP/WLP.

[6]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[7]  Bas van Gijzel,et al.  A principled approach to the implementation of argumentation models , 2014, COMMA.

[8]  Bart Verheij,et al.  Handbook of Argumentation Theory , 1987 .

[9]  Guillermo Ricardo Simari,et al.  A Mathematical Treatment of Defeasible Reasoning and its Implementation , 1992, Artif. Intell..

[10]  Odinaldo Rodrigues.  GRIS: Computing traditional argumentation semantics through numerical iterations , 2015 .

[11]  Stefano Bistarelli,et al.  ConArg 2 : A Constraint-based Tool for Abstract Argumentation , 2015 .

[12]  Massimiliano Giacomin,et al.  ArgSemSAT-1.0: exploiting SAT solvers in abstract argumentation , 2015 .

[13]  Sharad Malik,et al.  Boolean Satisfiability Solvers: Techniques and Extensions , 2012, Software Safety and Security.

[14]  Simon Wells.  Argument Mining: Was Ist Das? , 2014 .

[15]  Matthias Thimm,et al.  Tweety: A Comprehensive Collection of Java Libraries for Logical Aspects of Artificial Intelligence and Knowledge Representation , 2014, KR.

[16]  Pierre Marquis,et al.  Symmetric Argumentation Frameworks , 2005, ECSQARU.

[17]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[18]  Hannes Strass,et al.  The DIAMOND System for Computing with Abstract Dialectical Frameworks , 2014, COMMA.

[19]  Hannes Strass,et al.  A Benchmark Framework for a Computational Argumentation Competition , 2014, COMMA.

[20]  Beishui Liao,et al.  ZJU-ARG : A Decomposition-Based Solver for Abstract Argumentation , 2015 .

[21]  Thomas Linsbichler,et al.  Characteristics of multiple viewpoints in abstract argumentation , 2014, Artif. Intell..

[22]  Wolfgang Dvorák.  Computational Aspects of Abstract Argumentation , 2012 .

[23]  Guillermo Ricardo Simari,et al.  Defeasible logic programming: an argumentative approach , 2003, Theory and Practice of Logic Programming.

[24]  Stefano Bistarelli,et al.  A Comparative Test on the Enumeration of Extensions in Abstract Argumentation , 2015, Fundam. Informaticae.

[25]  Paul E. Dunne,et al.  Semi-stable semantics , 2006, J. Log. Comput..

[26]  Stefan Woltran,et al.  ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming , 2008, ICLP.

[27]  Massimiliano Giacomin,et al.  Where Are We Now? State of the Art and Future Trends of Solvers for Hard Argumentation Problems , 2016, COMMA.

[28]  Bas van Gijzel.  Dungell : A reference implementation of Dung ’ s argumentation frameworks in , 2015 .

[29]  Massimiliano Giacomin,et al.  Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach , 2013, TAFA.

[30]  Hannes Strass,et al.  Abstract Dialectical Frameworks Revisited , 2013, IJCAI.

[31]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[32]  Li Jin,et al.  Dynamics of argumentation systems: A division-based method , 2011, Artif. Intell..

[33]  Sarah Alice Gaggl,et al.  ASPARTIX-D: ASP Argumentation Reasoning Tool - Dresden , 2015 .

[34]  Wolfgang Faber,et al.  Manifold Answer-Set Programs for Meta-reasoning , 2009, LPNMR.

[35]  Evgenios Hadjisoteriou.  Computing Argumentation with Matrices , 2015, ICCSW.

[36]  Massimiliano Giacomin,et al.  An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation , 2014, KR.

[37]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[38]  Michael Wooldridge,et al.  Weighted argument systems: Basic definitions, algorithms, and complexity results , 2011, Artif. Intell..

[39]  Trevor J. M. Bench-Capon,et al.  Argumentation in artificial intelligence , 2007, Artif. Intell..

[40]  Stefano Bistarelli,et al.  Benchmarking Hard Problems in Random Abstract AFs: The Stable Semantics , 2014, COMMA.

[41]  Stefano Bistarelli,et al.  ConArg: A Tool for Classical and Weighted Argumentation , 2016, COMMA.

[42]  Pietro Baroni,et al.  SCC-recursiveness: a general schema for argumentation semantics , 2005, Artif. Intell..

[43]  Armin Biere.  Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling , 2014, POS@SAT.

[44]  Éric Grégoire,et al.  An Experimentally Efficient Method for (MSS, CoMSS) Partitioning , 2014, AAAI.

[45]  Bei Shui Liao,et al.  Toward incremental computation of argumentation semantics: A decomposition-based approach , 2013, Annals of Mathematics and Artificial Intelligence.

[46]  Stefano Bistarelli,et al.  A First Comparison of Abstract Argumentation Reasoning-Tools , 2014, ECAI.

[47]  Gilles Audemard,et al.  Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction , 2013, SAT.

[48]  Massimiliano Giacomin,et al.  Efficient and Off-The-Shelf Solver: jArgSemSAT , 2016, COMMA.

[49]  John Fox,et al.  Dungine: A Java Dung Reasoner , 2008, COMMA.

[50]  Katie Atkinson,et al.  Looking-ahead in backtracking algorithms for abstract argumentation , 2016, Int. J. Approx. Reason..

[51]  Russell H. Wagner.  Handbook of argumentation , 1936 .

[52]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[53]  Odinaldo Rodrigues.  Introducing EqArgSolver: An argumentation solver using equational semantics , 2016, SAFA@COMMA.

[54]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[55]  Tran Cao Son,et al.  Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning , 2011, Lecture Notes in Computer Science.

[56]  Stefan Woltran,et al.  Complexity-sensitive decision procedures for abstract argumentation , 2012, Artif. Intell..

[57]  Francesca Toni,et al.  Argumentation and answer set programming , 2011 .

[58]  Paul A. Herzberg,et al.  Principles of Statistics , 1983 .

[59]  Stefan Woltran,et al.  Methods for solving reasoning problems in abstract argumentation – A survey , 2015, Artif. Intell..

[60]  Stefan Woltran,et al.  Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas , 2006, COMMA.

[61]  Jean-Marie Lagniez,et al.  CoQuiAAS : Application of Constraint Programming for Abstract Argumentation ? , 2015 .

[62]  Massimiliano Giacomin,et al.  Argumentation Frameworks Features: an Initial Study , 2014, ECAI.

[63]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[64]  Martin Gebser,et al.  Clingo = ASP + Control: Preliminary Report , 2014, ArXiv.

[65]  Henry Prakken,et al.  The Carneades model of argument and burden of proof , 2007, Artif. Intell..

[66]  Serena Villata,et al.  System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA'15) , 2015, ArXiv.

[67]  Anthony Hunter,et al.  A probabilistic approach to modelling uncertain logical arguments , 2013, Int. J. Approx. Reason..

[68]  Martin Caminada,et al.  A QBF-based formalization of abstract argumentation semantics , 2013, J. Appl. Log..

[69]  Serena Villata,et al.  NoDE: A Benchmark of Natural Language Arguments , 2014, COMMA.

[70]  John L. Pollock,et al.  Justification and Defeat , 1994, Artif. Intell..

[71]  Guillermo Ricardo Simari,et al.  A survey of different approaches to support in argumentation systems , 2013, The Knowledge Engineering Review.

[72]  Michael Wooldridge,et al.  Complexity of Abstract Argumentation , 2009, Argumentation in Artificial Intelligence.

[73]  Jean-Marie Lagniez,et al.  CoQuiAAS: A Constraint-Based Quick Abstract Argumentation Solver , 2015, 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI).

[74]  Toshiko Wakaki.  Preference-Based Argumentation Capturing Prioritized Logic Programming , 2010, ArgMAS.

[75]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[76]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[77]  Anthony Hunter,et al.  Elements of Argumentation , 2007, ECSQARU.

[78]  R. Luce,et al.  A method of matrix analysis of group structure , 1949, Psychometrika.

[79]  Matti Järvisalo,et al.  Synthesizing Argumentation Frameworks from Examples , 2019, ECAI.

[80]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[81]  Pietro Baroni,et al.  An introduction to argumentation semantics , 2011, The Knowledge Engineering Review.

[82]  Trevor J. M. Bench-Capon,et al.  Coherence in finite argument systems , 2002, Artif. Intell..

[83]  Wolfgang Faber,et al.  prefMaxSAT: exploiting MaxSAT for enumerating preferred extensions , 2015 .

[84]  Matthias Thimm,et al.  A Probabilistic Semantics for abstract Argumentation , 2012, ECAI.

[85]  Ulises Cortés,et al.  Preferred extensions as stable models , 2008, Theory Pract. Log. Program..

[86]  Stefano Bistarelli,et al.  A First Comparison of Abstract Argumentation Systems: A Computational Perspective , 2013, CILC.

[87]  Thomas Linsbichler,et al.  Investigating the Relationship between Argumentation Semantics via Signatures , 2016, IJCAI.

[88]  Katie Atkinson,et al.  ArgTools: a backtracking-based solver for abstract argumentation , 2015 .

[89]  Philippe Besnard,et al.  Checking the acceptability of a set of arguments , 2004, NMR.

[90]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[91]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[92]  Stefan Woltran,et al.  CEGARTIX v 0 . 4 : A SAT-Based Counter-Example Guided Argumentation Reasoning Tool , 2015 .

[93]  Massimiliano Giacomin,et al.  jArgSemSAT: An Efficient Off-the-Shelf Solver for Abstract Argumentation Frameworks , 2016, KR.

[94]  Katie Atkinson,et al.  Algorithms for decision problems in argument systems under preferred semantics , 2014, Artif. Intell..