Complexity of semi-stable and stage semantics in argumentation frameworks
From MaRDI portal
Publication:656597
DOI10.1016/j.ipl.2010.04.005zbMath1229.68041OpenAlexW2093924042MaRDI QIDQ656597
Stefan Woltran, Wolfgang Dvořák
Publication date: 18 January 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.04.005
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
On rejected arguments and implicit conflicts: the hidden power of argumentation semantics ⋮ How does incoherence affect inconsistency-tolerant semantics for Datalog\(^\pm\)? ⋮ Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility ⋮ On the Complexity of Probabilistic Abstract Argumentation Frameworks ⋮ Improved answer-set programming encodings for abstract argumentation ⋮ Range-based argumentation semantics as two-valued models ⋮ The complexity landscape of claim-augmented argumentation frameworks ⋮ Characteristics of multiple viewpoints in abstract argumentation ⋮ Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ Dynamics of argumentation systems: a division-based method ⋮ A QBF-based formalization of abstract argumentation semantics ⋮ On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics ⋮ Complexity-sensitive decision procedures for abstract argumentation ⋮ Towards fixed-parameter tractable algorithms for abstract argumentation ⋮ Augmenting tractable fragments of abstract argumentation ⋮ Weighted argument systems: basic definitions, algorithms, and complexity results ⋮ Design and results of the second international competition on computational models of argumentation ⋮ Graph-classes of argumentation frameworks with collective attacks ⋮ Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence ⋮ Complexity of abstract argumentation under a claim-centric view ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey
Cites Work
- Unnamed Item
- Graph minors. III. Planar tree-width
- Digraph measures: Kelly decompositions, games, and orderings
- Argumentation in artificial intelligence
- On principle-based evaluation of extension-based argumentation semantics
- Computational properties of argument systems satisfying graph-theoretic constraints
- The computational complexity of ideal semantics
- Coherence in finite argument systems.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Parametrized complexity theory.
- Transition graphs and the star-height of regular events
- An Algorithm for Computing Semi-stable Semantics
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
This page was built for publication: Complexity of semi-stable and stage semantics in argumentation frameworks
