Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On consistency and completeness of autoepistemic theories
Fundamenta Informaticae
Proceedings of the eleventh international conference on Logic programming
A logic-based theory of deductive arguments
Artificial Intelligence
On the evaluation of argumentation formalisms
Artificial Intelligence
On principle-based evaluation of extension-based argumentation semantics
Artificial Intelligence
Elements of Argumentation
A Systematic Classification of Argumentation Frameworks where Semantics Agree
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Argumentation in Artificial Intelligence
Argumentation in Artificial Intelligence
On the complexity of linking deductive and abstract argument systems
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Dialectic proof procedures for assumption-based, admissible argumentation
Artificial Intelligence
SCC-recursiveness: a general schema for argumentation semantics
Artificial Intelligence
Expanding Argumentation Frameworks: Enforcing and Monotonicity Results
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Instantiating abstract argumentation with classical logic arguments: Postulates and properties
Artificial Intelligence
Foundations and extensions of answer set programming: the logical approach
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Splitting an argumentation framework
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Strong equivalence for argumentation semantics based on conflict-free sets
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Characterizing strong equivalence for argumentation frameworks
Artificial Intelligence
On the equivalence of logic-based argumentation systems
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
On the intertranslatability of argumentation semantics
Journal of Artificial Intelligence Research
Equivalence between extended datalog programs -- a brief survey
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Splitting argumentation frameworks: an empirical evaluation
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Parameterized splitting: a simple modification-based approach
Correct Reasoning
Journal of Logic and Computation
| Hi-index | 0.00 |
Given a semantics @s, two argumentation frameworks (AFs) F and G are said to be standard equivalent if they possess the same extensions and strongly equivalent if, for any AF H, F conjoined with H and G conjoined with H are standard equivalent. Argumentation is a dynamic process and, in general, new arguments occur in response to a former argument or, more precisely, attack a former argument. For this reason, rather than considering arbitrary expansions we focus here on expansions where new arguments and attacks may be added but the attacks among the old arguments remain unchanged. We define and characterize two new notions of equivalence between AFs (which lie in-between standard and strong equivalence), namely normal and strong expansion equivalence. Furthermore, using the characterization theorems proved in this paper, we draw the connections between all mentioned notions of equivalence including further equivalence relations, so-called weak and local expansion equivalence.