ConArg: A Constraint-Based Computational Framework for Argumentation Systems

We propose ConArg, a tool based on Constraint Programming, to model and solve various problems related to the Argumentation research field. Constraint Satisfaction Problems (CSPs) offer a wide number of efficient techniques (as inference and search algorithms) that can tackle the complexity in finding all the possible Dung's conflict-free, admissible, complete, stable, preferred and grounded extensions in Argumentation Frameworks. Moreover, we can use the tool to solve some computationally hard problems presented in [1]. To implement ConArg, we have used JaCoP, a Java library which provides the user with a Finite Domain Constraint Programming paradigm, to model and solve these two problems. ConArg is able to randomly generate two different kinds of small-world networks in order to find Dung's extensions on such interaction graphs. We present the main features of ConArg and the reported performance in time.

[1]  Stefano Bistarelli,et al.  ConArg: Argumentation with Constraints , 2012, AT.

[2]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[3]  Trevor J. M. Bench-Capon.  Persuasion in Practical Argument Using Value-based Argumentation Frameworks , 2003, J. Log. Comput..

[4]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

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

[6]  Toby Walsh,et al.  Handbook of Constraint Programming (Foundations of Artificial Intelligence) , 2006 .

[7]  Pierre Marquis,et al.  Constrained Argumentation Frameworks , 2006, KR.

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

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

[10]  Milind Tambe,et al.  Argumentation as distributed constraint satisfaction: applications and results , 2001, AGENTS '01.

[11]  Stefano Bistarelli,et al.  A Common Computational Framework for Semiring-based Argumentation Systems , 2010, ECAI.

[12]  Leila Amgoud,et al.  Argumentation frameworks as constraint satisfaction problems , 2011, Annals of Mathematics and Artificial Intelligence.

[13]  Claudette Cayrol,et al.  Inferring from Inconsistency in Preference-Based Argumentation Frameworks , 2002, Journal of Automated Reasoning.

[14]  Lucas Bordeaux,et al.  Propositional Satisfiability and Constraint Programming: A comparative survey , 2006, CSUR.

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

[16]  Paolo Torroni,et al.  Bottom-Up Argumentation , 2011, TAFA.

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

[18]  Gilad Ravid,et al.  Asynchronous discussion groups as Small World and Scale Free Networks , 2004, First Monday.

[19]  Ulises Cortés,et al.  Possibilistic-Based Argumentation: An Answer Set Programming Approach , 2008, 2008 Mexican International Conference on Computer Science.

[20]  Nikos I. Karacapilidis,et al.  The Zeno argumentation framework , 1997, ICAIL '97.

[21]  Sanjay Modgil,et al.  Reasoning about preferences in argumentation frameworks , 2009, Artif. Intell..

[22]  Stefano Bistarelli,et al.  Solving Weighted Argumentation Frameworks with Soft Constraints , 2010, CILC.

[23]  Krzysztof Kuchcinski,et al.  JaCoP - Java Constraint Programming Solver , 2013, CP 2013.