Dialogue Games for Enforcement of Argument Acceptance and Rejection via Attack Removal

Argumentation is dynamic in nature and most commonly exists in dialogical form between different agents trying to convince each other. While abstract argumentation framework are mostly static, many studies have focused on dynamical aspects and changes to these static frameworks. An important problem is the one of argument enforcement, modifying an argumentation framework in order to ensure that a certain argument is accepted. In this paper, we use dialogue games to provide an exhaustive list of minimal sets of attacks such that when removed, a given argument is credulously accepted with respect to preferred semantics. We then extend the method to enforce other acceptability statuses and cope with sets of arguments.

[1]  Claudette Cayrol,et al.  Change in Abstract Argumentation Frameworks: Adding an Argument , 2010, J. Artif. Intell. Res..

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

[3]  Ringo Baumann What Does it Take to Enforce an Argument? Minimal Change in abstract Argumentation , 2012, ECAI.

[4]  Li Jin,et al.  Dynamics of argumentation systems: A division-based method , 2011, Artif. Intell..

[5]  Henry Prakken,et al.  Credulous and Sceptical Argument Games for Preferred Semantics , 2000, JELIA.

[6]  Trevor J. M. Bench-Capon,et al.  Two party immediate response disputes: Properties and efficiency , 2003, Artif. Intell..

[7]  Sébastien Konieczny,et al.  On the Revision of Argumentation Systems: Minimal Change of Arguments Statuses , 2014, KR.

[8]  Pietro Baroni,et al.  SCC-recursiveness: a general schema for argumentation semantics , 2005, Artif. Intell..

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

[10]  Guido Boella,et al.  Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension , 2009, ECSQARU.

[11]  Paolo Torroni,et al.  A New Framework for ABMs Based on Argumentative Reasoning , 2013, ESSA.

[12]  Takeaki Uno,et al.  Enumerating Maximal Frequent Sets Using Irredundant Dualization , 2003, Discovery Science.