Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
Strong and uniform equivalence of nonmonotonic theories: an algebraic approach
Annals of Mathematics and Artificial Intelligence
Argumentation in artificial intelligence
Artificial Intelligence
Computing ideal sceptical argumentation
Artificial Intelligence
On the merging of Dung's argumentation systems
Artificial Intelligence
A common view on strong, uniform, and other notions of equivalence in answer-set programming*
Theory and Practice of Logic Programming
Achieving compositionality of the stable model semantics for smodels programs1
Theory and Practice of Logic Programming
Dynamics in argumentation with single extensions: attack refinement and the grounded extension
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Argument Theory Change: Revision Upon Warrant
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
SCC-recursiveness: a general schema for argumentation semantics
Artificial Intelligence
The computational complexity of ideal semantics
Artificial Intelligence
Expanding Argumentation Frameworks: Enforcing and Monotonicity Results
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Change in abstract argumentation frameworks: adding an argument
Journal of Artificial Intelligence Research
On the resolution-based family of abstract argumentation semantics and its grounded instance
Artificial Intelligence
Instantiating abstract argumentation with classical logic arguments: Postulates and properties
Artificial Intelligence
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
On the issue of reinstatement in argumentation
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Normal and strong expansion equivalence for argumentation frameworks
Artificial Intelligence
Hi-index | 0.00 |
Since argumentation is an inherently dynamic process, it is of great importance to understand the effect of incorporating new information into given argumentation frameworks. In this work, we address this issue by analyzing equivalence between argumentation frameworks under the assumption that the frameworks in question are incomplete, i.e. further information might be added later to both frameworks simultaneously. In other words, instead of the standard notion of equivalence (which holds between two frameworks, if they possess the same extensions), we require here that frameworks F and G are also equivalent when conjoined with any further framework H. Due to the nonmonotonicity of argumentation semantics, this concept is different to (but obviously implies) the standard notion of equivalence. We thus call our new notion strong equivalence and study how strong equivalence can be decided with respect to the most important semantics for abstract argumentation frameworks. We also consider variants of strong equivalence in which we define equivalence with respect to the sets of arguments credulously (or skeptically) accepted, and restrict strong equivalence to augmentations H where no new arguments are raised.