A general notion of equivalence for abstract argumentation
From MaRDI portal
Publication:2321336
Recommendations
Cites work
- scientific article; zbMATH DE number 6934384 (Why is no real title available?)
- Argumentation in artificial intelligence
- Argumentation update in YALLA (yet another logic language for argumentation)
- Characterizing strong equivalence for argumentation frameworks
- Coherence in finite argument systems.
- Computational models of argument (COMMA 2010). Proceedings of 3rd conference, Desanzano del Garda, Italy, September 2010.
- Computational properties of argument systems satisfying graph-theoretic constraints
- Context-free and context-sensitive kernels: update and deletion equivalence in abstract argumentation
- Dynamics of argumentation systems: a division-based method
- Looking-ahead in backtracking algorithms for abstract argumentation
- Modularity aspects of disjunctive stable models
- Normal and strong expansion equivalence for argumentation frameworks
- On graph equivalences preserved under extensions
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the evaluation of argumentation formalisms
- On the functional completeness of argumentation semantics
- On the input/output behavior of argumentation frameworks
- On the intertranslatability of argumentation semantics
- On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method
- Parameterized splitting: a simple modification-based approach
- Preprocessing argumentation frameworks via replacement patterns
- Relativized hyperequivalence of logic programs for modular programming
- Semantical characterizations and complexity of equivalences in answer set programming
- Splitting an Argumentation Framework
- The equivalence zoo for Dung-style semantics
- The first international competition on computational models of argumentation: results and analysis
- The role of self-attacking arguments in characterizations of equivalence notions
- Towards fixed-parameter tractable algorithms for abstract argumentation
- What does it take to enforce an argument? Minimal change in abstract argumentation
Cited in
(17)- The equivalence zoo for Dung-style semantics
- Analyzing the Equivalence Zoo in Abstract Argumentation
- Equivalence in logic-based argumentation
- Equivalence in argumentation frameworks with a claim-centric view: classical results with novel ingredients
- Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach
- Temporal duration-based probabilistic argumentation frameworks
- Characterizing strong equivalence for argumentation frameworks
- Acceptance in incomplete argumentation frameworks
- When are two arguments the same? Equivalence in abstract argumentation
- A general approach to extension-based semantics in abstract argumentation
- Inlining external sources in answer set programs
- Towards a general theory of decomposability in abstract argumentation
- Context-free and context-sensitive kernels: update and deletion equivalence in abstract argumentation
- scientific article; zbMATH DE number 7166761 (Why is no real title available?)
- Normal and strong expansion equivalence for argumentation frameworks
- scientific article; zbMATH DE number 6902516 (Why is no real title available?)
- Generalising Predicate and Argument Invariance
This page was built for publication: A general notion of equivalence for abstract argumentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321336)
