scientific article; zbMATH DE number 6747868

MaRDI QIDQ5282955zbMATH OpenFDO

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, http://ebooks.iospress.nl/volumearticle/36918

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27)

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

Cited in

(15)

• On the functional completeness of argumentation semantics
• On the expressive power of assumption-based argumentation
• SPARKs: succinct parallelizable arguments of knowledge
• scientific article; zbMATH DE number 7696698 (Why is no real title available?)
• The \(cf2\) argumentation semantics revisited
• A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation
• Realizability of three-valued semantics for abstract dialectical frameworks
• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
• On the preferred extensions of argumentation frameworks: bijections with naive sets
• Automata for infinite argumentation structures
• On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
• Characteristics of multiple viewpoints in abstract argumentation
• Constrained incomplete argumentation frameworks
• Continuum argumentation frameworks from cooperative game theory
• Open problems in abstract 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)