Characterizing strong equivalence for argumentation frameworks
From MaRDI portal
Publication:420788
DOI10.1016/j.artint.2011.06.003zbMath1252.68279OpenAlexW2129730018WikidataQ56551823 ScholiaQ56551823MaRDI QIDQ420788
Emilia Oikarinen, Stefan Woltran
Publication date: 23 May 2012
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2011.06.003
Related Items (22)
An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms ⋮ Argumentation update in YALLA (yet another logic language for argumentation) ⋮ Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility ⋮ Normal and strong expansion equivalence for argumentation frameworks ⋮ Equivalence in logic-based argumentation ⋮ Static and dynamic orderings on Dungean argumentation frameworks -- an overview ⋮ A general approach to extension-based semantics in abstract argumentation ⋮ Characterizing strong equivalence for argumentation frameworks ⋮ Handling and measuring inconsistency in non-monotonic logics ⋮ On the input/output behavior of argumentation frameworks ⋮ Local Expansion Invariant Operators in Argumentation Semantics ⋮ Updating Argumentation Frameworks for Enforcing Extensions ⋮ Incremental computation for structured argumentation over dynamic DeLP knowledge bases ⋮ Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets ⋮ On graph equivalences preserved under extensions ⋮ What Is a Reasonable Argumentation Semantics? ⋮ Open Problems in Abstract Argumentation ⋮ Probabilistic abstract argumentation frameworks, a possible world view ⋮ Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks ⋮ Strong inconsistency ⋮ A general notion of equivalence for abstract argumentation ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey
Cites Work
- Unnamed Item
- Characterizing strong equivalence for argumentation frameworks
- On graph equivalences preserved under extensions
- On the resolution-based family of abstract argumentation semantics and its grounded instance
- Instantiating abstract argumentation with classical logic arguments: postulates and properties
- Argumentation in artificial intelligence
- Computing ideal sceptical argumentation
- On principle-based evaluation of extension-based argumentation semantics
- On the merging of Dung's argumentation systems
- The computational complexity of ideal semantics
- Explanations, belief revision and defeasible reasoning.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- SCC-recursiveness: a general schema for argumentation semantics
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
- Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets
- An Algorithm for Computing Semi-stable Semantics
- On the Issue of Reinstatement in Argumentation
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- Change in Abstract Argumentation Frameworks: Adding an Argument
- Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension
- Semantical characterizations and complexity of equivalences in answer set programming
- Logic Programming and Nonmonotonic Reasoning
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- Strongly equivalent logic programs
This page was built for publication: Characterizing strong equivalence for argumentation frameworks
