Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks

DOI10.1007/978-3-540-87803-2_14MaRDI QIDQ3532464zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Martin Caminada, Paul E. Dunne

Publication date 27 October 2008

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87803-2_14

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Complexity of semi-stable and stage semantics in argumentation frameworks
• An Algorithm for Computing Semi-stable Semantics
• Semi-stable semantics
• Characteristics of multiple viewpoints in abstract argumentation
• The computational complexity of ideal semantics

Cited in

(27)

• Computational properties of argument systems satisfying graph-theoretic constraints
• A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
• Augmenting tractable fragments of abstract argumentation
• Complexity of nonemptiness in control argumentation frameworks
• Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
• Methods for solving reasoning problems in abstract argumentation -- a survey
• A QBF-based formalization of abstract argumentation semantics
• A Common Computational Framework for Semiring-based Argumentation Systems
• Semi-stable semantics
• An Algorithm for Computing Semi-stable Semantics
• Complexity-sensitive decision procedures for abstract argumentation
• Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility
• Paracoherent answer set semantics meets argumentation frameworks
• Minimal strong admissibility: a complexity analysis
• What is a reasonable argumentation semantics?
• Stochastic local search algorithms for abstract argumentation under stable semantics
• Theory of semi-instantiation in abstract argumentation
• On the maximal and average numbers of stable extensions
• Weighted argument systems: basic definitions, algorithms, and complexity results
• On the resolution-based family of abstract argumentation semantics and its grounded instance
• Computing stable extensions of argumentation frameworks using formal concept analysis
• Complexity of semi-stable and stage semantics in argumentation frameworks
• Constraints and lifting-based (conditional) preferences in abstract argumentation
• Abstract argumentation frameworks with strong and weak constraints
• Totality, determinism and functionality problems in (incomplete) abstract argumentation frameworks
• Characteristics of multiple viewpoints in abstract argumentation
• On efficiently estimating the probability of extensions in abstract argumentation frameworks

This page was built for publication: Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks

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