A General Notion of Equivalence for Abstract Argumentation

A General Notion of Equivalence for Abstract Argumentation

Ringo Baumann, Wolfgang Dvořák, Thomas Linsbichler, Stefan Woltran

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
Main track. Pages 800-806. https://doi.org/10.24963/ijcai.2017/111

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.
Keywords:
Knowledge Representation, Reasoning, and Logic: Computational Complexity of Reasoning
Knowledge Representation, Reasoning, and Logic: Computational models of Argument