On Looking for Local Expansion Invariants in Argumentation Semantics: a Preliminary Report
This work addresses a theoretical problem in computational argumentation, but it is incremental as it builds on existing concepts without introducing major new paradigms.
The authors tackled the problem of defining robustness in Abstract Argumentation Frameworks by studying invariant local expansion operators for conflict-free and admissible sets, resulting in a derived definition of robustness based on the number of times these operators can be applied without altering the semantics.
We study invariant local expansion operators for conflict-free and admissible sets in Abstract Argumentation Frameworks (AFs). Such operators are directly applied on AFs, and are invariant with respect to a chosen "semantics" (that is w.r.t. each of the conflict free/admissible set of arguments). Accordingly, we derive a definition of robustness for AFs in terms of the number of times such operators can be applied without producing any change in the chosen semantics.