Towards Advanced Systems for Abstract Argumentation

Within the last years, and in particular due to the first edition of the International Competition on Computational Models of Argumentation (ICCMA) in 2015, the field of formal argumentation has seen an increasing number of systems for Dung’s abstract argumentation framework. However, the majority of the current approaches rely on reductions to other solving paradigms like SAT-solving and Answer-Set Programming, thus leaving genuine features of abstract argumentation rather unexploited. In this talk, we present a few directions for the development of next-generation argumentation systems that take recent theoretical advances into account and discuss challenges as well as potential pitfalls in this endeavor.

[1]  Massimiliano Giacomin,et al.  Exploiting Parallelism for Hard Problems in Abstract Argumentation , 2015, AAAI.

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

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

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

[5]  Phan Minh Dung,et al.  Towards a Common Framework for Dialectical Proof Procedures in Abstract Argumentation , 2009, J. Log. Comput..

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

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

[8]  Stefan Woltran,et al.  Towards fixed-parameter tractable algorithms for abstract argumentation , 2012, Artif. Intell..

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

[10]  Inês Lynce,et al.  Conflict-Driven Clause Learning SAT Solvers , 2009, Handbook of Satisfiability.

[11]  Pietro Baroni,et al.  On topology-related properties of abstract argumentation semantics. A correction and extension to Dynamics of argumentation systems: A division-based method , 2014, Artif. Intell..

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

[13]  Thomas Linsbichler,et al.  The Hidden Power of Abstract Argumentation Semantics , 2015, TAFA.

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

[15]  Bart Verheij,et al.  A Labeling Approach to the Computation of Credulous Acceptance in Argumentation , 2007, IJCAI.

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

[17]  Hannes Strass,et al.  Compact Argumentation Frameworks , 2014, ECAI.

[18]  Massimiliano Giacomin,et al.  ArgSemSAT: Solving Argumentation Problems Using SAT , 2014, COMMA.

[19]  Paul E. Dunne,et al.  Computational properties of argument systems satisfying graph-theoretic constraints , 2007, Artif. Intell..

[20]  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..

[21]  Hannes Strass,et al.  Summary Report of The First International Competition on Computational Models of Argumentation , 2016, AI Mag..

[22]  Stefan Woltran,et al.  Parameterized Splitting: A Simple Modification-Based Approach , 2012, Correct Reasoning.

[23]  Huaxin Huang,et al.  Partial semantics of argumentation: basic properties and empirical , 2013, J. Log. Comput..