Baumann, R., Dvorak, W., Linsbichler, T., & Woltran, S. (2019). A general notion of equivalence for abstract argumentation. Artificial Intelligence, 275, 379–410. https://doi.org/10.1016/j.artint.2019.06.006
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
Journal:
Artificial Intelligence
-
ISSN:
0004-3702
-
Date (published):
2019
-
Number of Pages:
32
-
Publisher:
ELSEVIER
-
Peer reviewed:
Yes
-
Keywords:
Artificial Intelligence; Linguistics and Language; Language and Linguistics; Abstract argumentation Equivalence Local simplification Computational complexity
-
Abstract:
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. We also provide exact characterizations and complexity results. The proposed notion of equivalence is motivated by its capability to capture the concept of local simplifications. In fact, our equivalence notion allows to decide whether a sub-framework can be replaced by another one without changing the extensions in the framework which undergoes this change. Moreover, as our characterizations demonstrate deciding this form of equivalence does not require an analysis of the entire framework. This makes it an appealing formal underpinning for establishing general replacement patterns in argumentation frameworks.
en
Project title:
START: Y 698-N23 (Fonds zur Förderung der wissenschaftlichen Forschung (FWF)) Advanced Tools for Graph - Based Formal Argumentation: I2854-N35 (Fonds zur Förderung der wissenschaftlichen Forschung (FWF)) EMBArg