The computational complexity of ideal semantics I: Abstract argumentation frameworks

Frontiers in Artificial Intelligence and Applications

Volumn 172, Issue 1, 2008, Pages 147-158

  Dunne, Paul E ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Computational complexity; Computational properties of argumentation; Formalization of abstract argumentation

Indexed keywords

DECISION THEORY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SEMANTICS;

ABSTRACT ARGUMENTATION; ADMISSIBILITY SEMANTICS; ALGORITHMIC APPROACH; ARGUMENTATION FRAMEWORKS; COMPUTATIONAL PROPERTIES; COMPUTATIONAL PROPERTY OF ARGUMENTATION; DECISION PROBLEMS; FORMALISATION; FORMALIZATION OF ABSTRACT ARGUMENTATION; POLYNOMIAL-TIME ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 84875917671     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (22)

1. L. M. Adleman and K. Manders. Reducibility, randomness and intractibility. In Proc. 9th ACM Symposium on Theory of Computing, pages 151-163, 1979.
2. A. Blass and Y. Gurevich. On the unique satisfiability problem. Information and Control, 55:80-82, 1982.
3. A. Bondarenko, P.M. Dung, R.A. Kowalski, and F. Toni. An abstract, argumentationtheoretic approach to default reasoning. Artificial Intelligence, 93:63-101, 1997.
4. R. Chang and J. Kadin. On computing Boolean connectives of characteristic functions. Math. Syst. Theory, 28:173-198, 1995.
5. R. Chang, J. Kadin, and P. Rohatgi. On unique satisfiability and the threshold behavior of randomised reductions. Jnl. of Comp. and Syst. Sci., pages 359-373, 1995.
6. Y. Dimopoulos, B. Nebel, and F. Toni. Preferred arguments are harder to compute than stable extensions. In D. Thomas, editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99-Vol1), pages 36-43, San Francisco, 1999. Morgan Kaufmann Publishers.
7. Y. Dimopoulos, B. Nebel, and F. Toni. Finding admissible and preferred arguments can be very hard. In A. G. Cohn, F. Giunchiglia, and B. Selman, editors, KR2000: Principles of Knowledge Representation and Reasoning, pages 53-61, San Francisco, 2000. Morgan Kaufmann.
8. Y. Dimopoulos, B. Nebel, and F. Toni. On the computational complexity of assumptionbased argumentation for default reasoning. Artificial Intelligence, 141:55-78, 2002.
9. Y. Dimopoulos and A. Torres. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science, 170:209-244, 1996.
10. P. M. Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence, 77:321-357, 1995.
11. P. M. Dung, P. Mancarella, and F. Toni. A dialectical procedure for sceptical assumptionbased argumentation. In P. E. Dunne and T. J. M. Bench-Capon, editors, Proc. 1st Int. Conf. on Computational Models of Argument, volume 144 of FAIA, pages 145-156. IOS Press, 2006.
12. P. M. Dung, P. Mancarella, and F. Toni. Computing ideal sceptical argumentation. Artificial Intelligence, 171:642-674, 2007.
13. P. E. Dunne. The computational complexity of ideal semantics I: abstract argumentation frameworks. Technical Report ULCS-07-008, Dept. of Comp. Sci., Univ. of Liverpool, June 2007.
14. P. E. Dunne. Computational properties of argument systems satisfying graph-theoretic constraints. Artificial Intelligence, 171:701-729, 2007.
15. P. E. Dunne and T. J. M. Bench-Capon. Coherence in finite argument systems. Artificial Intelligence, 141:187-203, 2002.
16. B. Jenner and J. Toran. Computing functions with parallel queries to NP. Theoretical Computer Science, 141:175-193, 1995.
17. D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity, pages 67-161. Elsevier Science, 1998.
18. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
19. L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85-93, 1986.
20. G. Vreeswijk and H. Prakken. Credulous and sceptical argument games for preferred semantics. In Proceedings of JELIA'2000, The 7th European Workshop on Logic for Artificial Intelligence., pages 224-238, Berlin, 2000. Springer LNAI 1919, Springer Verlag.
21. K. Wagner. Bounded query computations. In Proc. 3rd Conf. on Structure in Complexity Theory, pages 260-277, 1988.
22. K. Wagner. Bounded query classes. SIAM Jnl. Comput., 19:833-846, 1990.