A Monte-Carlo tree search in argumentation

Monte-Carlo Tree Search (MCTS) is a heuristic to search in large trees. We apply it to argumentative puzzles where MCTS pursues the best argumentation with respect to a set of arguments to be argued. To make our ideas as widely applicable as possible, we integrate MCTS to an abstract setting for argumentation where the content of arguments is left unspecified. Experimental results show the pertinence of this integration for learning argumentations by comparing it with a basic reinforcement learning.

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

[2]  Levente Kocsis,et al.  Transpositions and move groups in Monte Carlo tree search , 2008, 2008 IEEE Symposium On Computational Intelligence and Games.

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

[4]  Ivan Bratko,et al.  Argument based machine learning , 2006, Artif. Intell..

[5]  Henry Prakken,et al.  Argument-Based Extended Logic Programming with Defeasible Priorities , 1997, J. Appl. Non Class. Logics.

[6]  Henry Prakken,et al.  Heuristics in Argumentation: A Game-Theoretical Investigation , 2008, COMMA 2008.

[7]  Henry Prakken,et al.  Reasoning with precedents in a dialogue game , 1997, ICAIL '97.

[8]  Antonino Rotolo,et al.  Probabilistic rule-based argumentation for norm-governed learning agents , 2012, Artificial Intelligence and Law.

[9]  L. Amgoud,et al.  An Argumentation Framework for Concept Learning , 2006 .

[10]  Csaba Szepesvári,et al.  Bandit Based Monte-Carlo Planning , 2006, ECML.

[11]  Henry Prakken,et al.  A hybrid formal theory of arguments, stories and criminal evidence , 2010, Artificial Intelligence and Law.

[12]  Simon M. Lucas,et al.  A Survey of Monte Carlo Tree Search Methods , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[13]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.