NP is as easy as detecting unique solutions
Theoretical Computer Science
SIAM Journal on Computing
Computing functions with parallel queries to NP
Theoretical Computer Science
Graph theoretical structures in logic programs and default theories
Theoretical Computer Science
An abstract, argumentation-theoretic approach to default reasoning
Artificial Intelligence
Artificial Intelligence
On the computational complexity of assumption-based argumentation for default reasoning
Artificial Intelligence
Coherence in finite argument systems
Artificial Intelligence
Preferred Arguments are Harder to Compute than Stable Extension
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Computing ideal sceptical argumentation
Artificial Intelligence
On principle-based evaluation of extension-based argumentation semantics
Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Comparing Argumentation Semantics with Respect to Skepticism
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
An Algorithm for Computing Semi-stable Semantics
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
A dialectic procedure for sceptical, assumption-based argumentation
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
A labeling approach to the computation of credulous acceptance in argumentation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Complexity of semi-stable and stage semantics in argumentation frameworks
Information Processing Letters
Weighted argument systems: Basic definitions, algorithms, and complexity results
Artificial Intelligence
On the resolution-based family of abstract argumentation semantics and its grounded instance
Artificial Intelligence
On the intertranslatability of argumentation semantics
Journal of Artificial Intelligence Research
Augmenting tractable fragments of abstract argumentation
Artificial Intelligence
On the complexity of computing the justification status of an argument
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Complexity-sensitive decision procedures for abstract argumentation
Artificial Intelligence
| Hi-index | 0.00 |
Semi-stable semantics offer a further extension based formalism by which the concept of "collection of justified arguments" in abstract argumentation frameworks may be described. In contrast to the better known stable semantics, one advantage of semi-stability is that any finite argumentation framework always has at least one semi-stable extension. Although there has been some development of the formal logical theory of semi-stable semantics so that several computational properties of these extensions have been identified, with the exception of some algorithmic studies, more detailed investigation of computational complexity issues has been neglected. Our purpose in this article is to present a number of results on the complexity of some natural decision questions for semi-stable semantics.