Graph-classes of argumentation frameworks with collective attacks
From MaRDI portal
Publication:2055773
DOI10.1007/978-3-030-75775-5_1OpenAlexW3161103327MaRDI QIDQ2055773
Stefan Woltran, Wolfgang Dvořák, Matthias Koenig
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75775-5_1
Related Items (2)
Expressiveness of SETAFs and support-free ADFs under 3-valued semantics ⋮ Graph-classes of argumentation frameworks with collective attacks
Cites Work
- Unnamed Item
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Graph theoretical structures in logic programs and default theories
- Computational properties of argument systems satisfying graph-theoretic constraints
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Augmenting tractable fragments of abstract argumentation
- Coherence in finite argument systems.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Graph-classes of argumentation frameworks with collective attacks
- A comprehensive study of argumentation frameworks with sets of attacking arguments
- Understanding the Abstract Dialectical Framework
- On the Intertranslatability of Argumentation Semantics
- On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs
- On the Expressive Power of Collective Attacks
- Toward a More Efficient Generation of Structured Argumentation Graphs
- A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
- Logics in Artificial Intelligence
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
This page was built for publication: Graph-classes of argumentation frameworks with collective attacks
