Using Matrix Exponentials for Abstract Argumentation

We investigate the relationship between semantics for formal argumentation and measures from social networking theory. In particular, we consider using matrix exponentials, which are measures used for link prediction and recommendation in social networks, as a way to measure acceptability of arguments in abstract argumentation frameworks. We reformulate the approach of matrix exponentials to adhere for the fact that, compared to the social network setting, edges in argumentation frameworks have a negative connotation, arguments linked by edges should not be accepted together, and empirically evaluate this approach on benchmark graphs from ICCMA’15. Moreover, matrix exponentials can also be used for prediction in so-called signed social networks, which have both positive and negative edges denoting friend and foe relationships. As these networks bear a close resemblance to bipolar argumentation frameworks, we extend our framework and investigate the applicability of matrix exponentials from signed networks to be used in bipolar argumentation frameworks as well. Finally, we evaluate postulates for ranking-based argumentation semantics for our approach.

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

[2]  Paul E. Dunne,et al.  Spectral Techniques in Argumentation Framework Analysis , 2016, COMMA.

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

[4]  Ernesto Estrada,et al.  The Structure of Complex Networks: Theory and Applications , 2011 .

[5]  Jérôme Kunegis,et al.  Applications of Structural Balance in Signed Social Networks , 2014, ArXiv.

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

[7]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[8]  E. Sklar,et al.  A system of argumentation for reasoning about trust , 2010 .

[9]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[10]  Iyad Rahwan,et al.  Experiments for Assessing Floating Reinstatement in Argument-based Reasoning , 2010 .

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

[12]  C. Cayrol,et al.  On the Acceptability of Arguments in Bipolar Argumentation Frameworks , 2005, ECSQARU.

[13]  Leila Amgoud,et al.  Ranking-Based Semantics for Argumentation Frameworks , 2013, SUM.

[14]  Claudette Cayrol,et al.  On bipolarity in argumentation frameworks , 2008, NMR.

[15]  Sahin Albayrak,et al.  Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization , 2010, SDM.

[16]  João Leite,et al.  On the Efficient Implementation of Social Abstract Argumentation , 2014, ECAI.

[17]  Claudette Cayrol,et al.  The Matrix Approach for Abstract Argumentation Frameworks , 2015, TAFA.

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