GRAPPA: A Semantical Framework for Graph-Based Argument Processing

Graphical models are widely used in argumentation to visualize relationships among propositions or arguments. The intuitive meaning of the links in the graphs is typically expressed using labels of various kinds. In this paper we introduce a general semantical framework for assigning a precise meaning to labelled argument graphs which makes them suitable for automatic evaluation. Our approach rests on the notion of explicit acceptance conditions, as first studied in Abstract Dialectical Frameworks (ADFs). The acceptance conditions used here are functions from multisets of labels to truth values. We define various Dung style semantics for argument graphs. We also introduce a pattern language for specifying acceptance functions. Moreover, we show how argument graphs can be compiled to ADFs, thus providing an automatic evaluation tool via existing ADF implementations. Finally, we also discuss complexity issues.

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

[2]  Claudette Cayrol,et al.  Bipolarity in argumentation graphs: Towards a better understanding , 2013, Int. J. Approx. Reason..

[3]  Gerhard Brewka,et al.  Carneades and Abstract Dialectical Frameworks: A Reconstruction , 2010, COMMA.

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

[5]  Stefan Woltran,et al.  Abstract Dialectical Frameworks , 2010, KR.

[6]  Mutsunori Banbara,et al.  Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems , 2013, SAT.

[7]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[8]  Arthur M. Farley,et al.  Burden of proof in legal argumentation , 1995, ICAIL '95.

[9]  Douglas Walton,et al.  Proof Burdens and Standards , 2009, Argumentation in Artificial Intelligence.

[10]  L. Amgoud,et al.  On bipolarity in argumentation frameworks , 2008 .

[11]  Sanjay Modgil,et al.  Theory and Applications of Formal Argumentation: Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers. , 2014 .

[12]  Hannes Strass,et al.  Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory , 2015, Artif. Intell..

[13]  Dov M. Gabbay.  Equational approach to argumentation networks , 2012, Argument Comput..

[14]  Sébastien Konieczny,et al.  Weighted Attacks in Argumentation Frameworks , 2012, KR.

[15]  Hannes Strass,et al.  The DIAMOND System for Argumentation: Preliminary Report , 2013, ArXiv.

[16]  Victor W. Marek,et al.  Ultimate approximation and its application in nonmonotonic knowledge representation systems , 2004, Inf. Comput..

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