A general notion of equivalence for abstract argumentation
From MaRDI portal
Publication:2321336
DOI10.1016/J.ARTINT.2019.06.006zbMATH Open1478.68342OpenAlexW2739502272MaRDI QIDQ2321336FDOQ2321336
Authors: Ringo Baumann, Wolfgang Dvořák, Thomas Linsbichler, Stefan Woltran 
Publication date: 28 August 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2019.06.006
Recommendations
Cites Work
- Argumentation in artificial intelligence
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Modularity aspects of disjunctive stable models
- On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method
- Argumentation update in YALLA (yet another logic language for argumentation)
- What does it take to enforce an argument? Minimal change in abstract argumentation
- Characterizing strong equivalence for argumentation frameworks
- On the input/output behavior of argumentation frameworks
- Dynamics of argumentation systems: a division-based method
- On the evaluation of argumentation formalisms
- Computational properties of argument systems satisfying graph-theoretic constraints
- The first international competition on computational models of argumentation: results and analysis
- Looking-ahead in backtracking algorithms for abstract argumentation
- Coherence in finite argument systems.
- Splitting an Argumentation Framework
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Parameterized splitting: a simple modification-based approach
- On the intertranslatability of argumentation semantics
- Computational models of argument (COMMA 2010). Proceedings of 3rd conference, Desanzano del Garda, Italy, September 2010.
- Normal and strong expansion equivalence for argumentation frameworks
- Semantical characterizations and complexity of equivalences in answer set programming
- On graph equivalences preserved under extensions
- Relativized hyperequivalence of logic programs for modular programming
- The role of self-attacking arguments in characterizations of equivalence notions
- Title not available (Why is that?)
- Context-free and context-sensitive kernels: update and deletion equivalence in abstract argumentation
- Preprocessing argumentation frameworks via replacement patterns
- The equivalence zoo for Dung-style semantics
- On the functional completeness of argumentation semantics
Cited In (16)
- 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
- Characterizing strong equivalence for argumentation frameworks
- Acceptance in incomplete argumentation frameworks
- When are two arguments the same? Equivalence in abstract argumentation
- Inlining external sources in answer set programs
- A general approach to extension-based semantics in abstract argumentation
- Towards a general theory of decomposability in abstract argumentation
- Context-free and context-sensitive kernels: update and deletion equivalence in abstract argumentation
- Title not available (Why is that?)
- Normal and strong expansion equivalence for argumentation frameworks
- Title not available (Why is that?)
- 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)
