Semantical considerations on nonmonotonic logic
Artificial Intelligence
NP is as easy as detecting unique solutions
Theoretical Computer Science
On the relation between default and autoepistemic logic
Artificial Intelligence
SIAM Journal on Computing
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Computing functions with parallel queries to NP
Theoretical Computer Science
On unique satisfiability and the threshold behavior of randomized reductions
Journal of Computer and System Sciences
Graph theoretical structures in logic programs and default theories
Theoretical Computer Science
An abstract, argumentation-theoretic approach to default reasoning
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
The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Reducibility, randomness, and intractibility (Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Two party immediate response disputes: properties and efficiency
Artificial Intelligence
Argumentation in artificial intelligence
Artificial Intelligence
Computing ideal sceptical argumentation
Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
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
Dialectic proof procedures for assumption-based, admissible argumentation
Artificial 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
A computational method for defeasible argumentation based on a recursive warrant semantics
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
Manifold answer-set programs and their applications
Logic programming, knowledge representation, and nonmonotonic reasoning
Argumentation and answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
Characterizing strong equivalence for argumentation frameworks
Artificial Intelligence
Towards fixed-parameter tractable algorithms for abstract argumentation
Artificial Intelligence
Parametric properties of ideal semantics
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
A generalised framework for dispute derivations in assumption-based argumentation
Artificial Intelligence
Automata for infinite argumentation structures
Artificial Intelligence
On the complexity of probabilistic abstract argumentation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Complexity-sensitive decision procedures for abstract argumentation
Artificial Intelligence
| Hi-index | 0.00 |
We analyse the computational complexity of the recently proposed ideal semantics within both abstract argumentation frameworks (afs) and assumption-based argumentation frameworks (abfs). It is shown that while typically less tractable than credulous admissibi-lity semantics, the natural decision problems arising with this extension-based model can, perhaps surprisingly, be decided more efficiently than sceptical preferred semantics. In particular the task of finding the unique ideal extension is easier than that of deciding if a given argument is accepted under the sceptical semantics. We provide efficient algorithmic approaches for the class of bipartite argumentation frameworks and, finally, present a number of technical results which offer strong indications that typical problems in ideal argumentation are complete for the class p"@?^C of languages decidable by polynomial time algorithms allowed to make non-adaptive queries to a C oracle, where C is an upper bound on the computational complexity of deciding credulous acceptance: C=np for afs and logic programming (lp) instantiations of abfs; C=@S"2^p for abfs modelling default theories.