A General Notion of Equivalence for Abstract Argumentation

We introduce a parametrized equivalence notion for abstract argumentation that subsumes standard and strong equivalence as corner cases. Under this notion, two argumentation frameworks are equivalent if they deliver the same extensions under any addition of arguments and attacks that do not affect a given set of core arguments. As we will see, this notion of equivalence nicely captures the concept of local simplifications. We provide exact characterizations and complexity results for deciding our new notion of equivalence.

[1]  Miroslaw Truszczynski,et al.  Relativized Hyperequivalence of Logic Programs for Modular Programming , 2008, ICLP.

[2]  Claudette Cayrol,et al.  Argumentation update in YALLA (Yet Another Logic Language for Argumentation) , 2016, Int. J. Approx. Reason..

[3]  Michael Wooldridge,et al.  Complexity of Abstract Argumentation , 2009, Argumentation in Artificial Intelligence.

[4]  Ringo Baumann,et al.  Splitting an Argumentation Framework , 2011, LPNMR.

[5]  Ringo Baumann.  Characterizing Equivalence Notions for Labelling-Based Semantics , 2016, KR.

[6]  Pietro Baroni,et al.  Abstract Argumentation Frameworks and Their Semantics , 2018 .

[7]  Ringo Baumann,et al.  Expanding Argumentation Frameworks: Enforcing and Monotonicity Results , 2010, COMMA.

[8]  Ringo Baumann,et al.  Context-free and Context-sensitive Kernels: Update and Deletion Equivalence in abstract Argumentation , 2014, ECAI.

[9]  Ringo Baumann,et al.  The equivalence zoo for Dung-style semantics , 2018, J. Log. Comput..

[10]  Stefan Woltran,et al.  Characterizing Strong Equivalence for Argumentation Frameworks , 2010, KR.

[11]  Adrian Haret,et al.  Two Sides of the Same Coin: Belief Revision and Enforcing Arguments , 2018, IJCAI.

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

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

[14]  Stefan Woltran,et al.  On the Intertranslatability of Argumentation Semantics , 2011, J. Artif. Intell. Res..

[15]  Thomas Linsbichler,et al.  Verifiability of Argumentation Semantics , 2016, COMMA.

[16]  Pietro Baroni,et al.  On topology-related properties of abstract argumentation semantics. A correction and extension to Dynamics of argumentation systems: A division-based method , 2014, Artif. Intell..

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

[18]  Stefan Woltran,et al.  Modularity Aspects of Disjunctive Stable Models , 2007, LPNMR.

[19]  Trevor J. M. Bench-Capon,et al.  Coherence in finite argument systems , 2002, Artif. Intell..

[20]  Ringo Baumann,et al.  Normal and strong expansion equivalence for argumentation frameworks , 2012, Artif. Intell..

[21]  Stefan Woltran,et al.  The role of self-attacking arguments in characterizations of equivalence notions , 2016, J. Log. Comput..

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

[23]  Stefan Woltran,et al.  Semantical characterizations and complexity of equivalences in answer set programming , 2005, TOCL.

[24]  Wolfgang Dvorák,et al.  Computational Problems in Formal Argumentation and their Complexity , 2017, FLAP.

[25]  Tomi Janhunen,et al.  Modular Equivalence for Normal Logic Programs , 2006, ECAI.

[26]  Hannes Strass,et al.  On rejected arguments and implicit conflicts: The hidden power of argumentation semantics , 2016, Artif. Intell..

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

[28]  Thomas Linsbichler,et al.  On the Functional Completeness of Argumentation Semantics , 2015, DKB/KIK@KI.

[29]  Stefan Woltran,et al.  Parameterized Splitting: A Simple Modification-Based Approach , 2012, Correct Reasoning.

[30]  Miroslaw Truszczynski,et al.  On graph equivalences preserved under extensions , 2011, Discret. Math..

[31]  Martin Caminada,et al.  On the evaluation of argumentation formalisms , 2007, Artif. Intell..

[32]  Trevor J. M. Bench-Capon,et al.  Argumentation in artificial intelligence , 2007, Artif. Intell..

[33]  Serena Villata,et al.  On the Input/Output behavior of argumentation frameworks , 2014, Artif. Intell..

[34]  Ur Informationssysteme,et al.  Towards Fixed-Parameter Tractable Algorithms for Abstract Argumentation , 2011 .

[35]  Ringo Baumann,et al.  A Study of Unrestricted Abstract Argumentation Frameworks , 2017, IJCAI.

[36]  Thomas Linsbichler,et al.  A general notion of equivalence for abstract argumentation , 2019, Artif. Intell..