scientific article; zbMATH DE number 6747868
From MaRDI portal
Publication:5282955
zbMATH Open1366.68276arXiv1404.7734MaRDI QIDQ5282955FDOQ5282955
Authors: Ringo Baumann, Wolfgang Dvořák, Thomas Linsbichler, Hannes Strass, Stefan Woltran 
Publication date: 18 July 2017
Full work available at URL: https://arxiv.org/abs/1404.7734
Title of this publication is not available (Why is that?)
Recommendations
- Argumentation frameworks as constraint satisfaction problems
- A proof theorical framework for argumentation modeling
- Revisiting Abstract Argumentation Frameworks
- Computation in extended argumentation frameworks
- Constrained incomplete argumentation frameworks
- Simple contrapositive assumption-based argumentation frameworks
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27)
Cited In (15)
- The \(cf2\) argumentation semantics revisited
- Realizability of three-valued semantics for abstract dialectical frameworks
- A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation
- Constrained incomplete argumentation frameworks
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
- SPARKs: succinct parallelizable arguments of knowledge
- Characteristics of multiple viewpoints in abstract argumentation
- Title not available (Why is that?)
- On the preferred extensions of argumentation frameworks: bijections with naive sets
- Continuum argumentation frameworks from cooperative game theory
- Open problems in abstract argumentation
- On the functional completeness of argumentation semantics
- Automata for infinite argumentation structures
- On the expressive power of assumption-based argumentation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282955)
