scientific article; zbMATH DE number 6747868
From MaRDI portal
Publication:5282955
zbMath1366.68276arXiv1404.7734MaRDI QIDQ5282955
Hannes Strass, Thomas Linsbichler, Ringo Baumann, Stefan Woltran, Wolfgang Dvořák
Publication date: 18 July 2017
Full work available at URL: https://arxiv.org/abs/1404.7734
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in artificial intelligence (68T27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Constrained incomplete argumentation frameworks ⋮ On rejected arguments and implicit conflicts: the hidden power of argumentation semantics ⋮ On the preferred extensions of argumentation frameworks: bijections with naive sets ⋮ Characteristics of multiple viewpoints in abstract argumentation ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation ⋮ Open Problems in Abstract Argumentation ⋮ Realizability of three-valued semantics for abstract dialectical frameworks
This page was built for publication: