Complexity of semi-stable and stage semantics in argumentation frameworks

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Cites Work

Title not available (Why is that?)
Argumentation in artificial intelligence
The computational complexity of ideal semantics
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
Parametrized complexity theory.
Digraph measures: Kelly decompositions, games, and orderings
Graph minors. III. Planar tree-width
Computational properties of argument systems satisfying graph-theoretic constraints
An Algorithm for Computing Semi-stable Semantics
On principle-based evaluation of extension-based argumentation semantics
Coherence in finite argument systems.
Transition graphs and the star-height of regular events
Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks

Cited In (25)

Augmenting tractable fragments of abstract argumentation
Towards fixed-parameter tractable algorithms for abstract argumentation
Design and results of the second international competition on computational models of argumentation
Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
A QBF-based formalization of abstract argumentation semantics
A Common Computational Framework for Semiring-based Argumentation Systems
Dynamics of argumentation systems: a division-based method
On efficiently estimating the probability of extensions in abstract argumentation frameworks
On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics
Complexity of nonemptiness in control argumentation frameworks
The complexity landscape of claim-augmented argumentation frameworks
Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks
Weighted argument systems: basic definitions, algorithms, and complexity results
Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility
On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
Range-based argumentation semantics as two-valued models
Complexity-sensitive decision procedures for abstract argumentation
Graph-classes of argumentation frameworks with collective attacks
Characteristics of multiple viewpoints in abstract argumentation
Improved answer-set programming encodings for abstract argumentation
Complexity of abstract argumentation under a claim-centric view
Paracoherent Answer Set Semantics meets Argumentation Frameworks
On the Complexity of Probabilistic Abstract Argumentation Frameworks
How does incoherence affect inconsistency-tolerant semantics for Datalog\(^\pm\)?
Methods for solving reasoning problems in abstract argumentation -- a survey

Recommendations

This page was built for publication: Complexity of semi-stable and stage semantics in argumentation frameworks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656597)