Complexity of semi-stable and stage semantics in argumentation frameworks
From MaRDI portal
Publication:656597
Recommendations
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Stage semantics and the SCC-recursive schema for argumentation semantics
- Defining stage argumentation semantics in terms of an abducible semantics
- A Common Computational Framework for Semiring-based Argumentation Systems
- Theory of semi-instantiation in abstract argumentation
- Conflict-tolerant semantics for argumentation frameworks
- A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
- Comparing the expressiveness of argumentation semantics
Cites work
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- An Algorithm for Computing Semi-stable Semantics
- Argumentation in artificial intelligence
- Coherence in finite argument systems.
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Computational properties of argument systems satisfying graph-theoretic constraints
- Digraph measures: Kelly decompositions, games, and orderings
- Graph minors. III. Planar tree-width
- On principle-based evaluation of extension-based argumentation semantics
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Parametrized complexity theory.
- The computational complexity of ideal semantics
- Transition graphs and the star-height of regular events
Cited in
(29)- Complexity-sensitive decision procedures for abstract argumentation
- Improved answer-set programming encodings for abstract argumentation
- Paracoherent answer set semantics meets argumentation frameworks
- An Algorithm for Computing Semi-stable Semantics
- Augmenting tractable fragments of abstract argumentation
- Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility
- A Common Computational Framework for Semiring-based Argumentation Systems
- Semi-stable semantics
- Graph-classes of argumentation frameworks with collective attacks
- On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics
- Design and results of the second international competition on computational models of argumentation
- Stage semantics and the SCC-recursive schema for argumentation semantics
- The complexity landscape of claim-augmented argumentation frameworks
- Incremental computation of deterministic extensions for dynamic argumentation frameworks
- On the complexity of probabilistic abstract argumentation frameworks
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Weighted argument systems: basic definitions, algorithms, and complexity results
- How does incoherence affect inconsistency-tolerant semantics for Datalog\(^\pm\)?
- Complexity of abstract argumentation under a claim-centric view
- A QBF-based formalization of abstract argumentation semantics
- Range-based argumentation semantics as two-valued models
- Dynamics of argumentation systems: a division-based method
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
- Characteristics of multiple viewpoints in abstract argumentation
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- Complexity of nonemptiness in control argumentation frameworks
- Methods for solving reasoning problems in abstract argumentation -- a survey
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656597)
