The computational complexity of ideal semantics

Artificial Intelligence

Volumn 173, Issue 18, 2009, Pages 1559-1591

  Dunne, Paul E ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Abstract argumentation frameworks; Assumption based argumentation; Computational complexity; Computational properties of argumentation

Indexed keywords

ABSTRACT ARGUMENTATION; ABSTRACT ARGUMENTATION FRAMEWORKS; ALGORITHMIC APPROACH; ARGUMENTATION FRAMEWORKS; ASSUMPTION-BASED ARGUMENTATION; COMPUTATIONAL PROPERTIES OF ARGUMENTATION; CREDULOUS ACCEPTANCE; DECISION PROBLEMS; DEFAULT THEORY; POLYNOMIAL-TIME ALGORITHMS; PREFERRED SEMANTICS; UPPER BOUND;

ABSTRACTING; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL EFFICIENCY; COMPUTATIONAL LINGUISTICS; LOGIC PROGRAMMING; POLYNOMIAL APPROXIMATION; SEMANTICS;

COMPUTATIONAL COMPLEXITY;

EID: 70350566068     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2009.09.001     Document Type: Article

References (37)

1. L.M. Adleman, K. Manders, Reducibility, randomness and intractibility, in: Proc. 9th ACM Symposium on Theory of Computing, 1979, pp. 151-163
2. Bench-Capon T.J.M., and Dunne P.E. Argumentation in artificial intelligence. Artificial Intelligence 171 (2007) 619-641
3. Blass A., and Gurevich Y. On the unique satisfiability problem. Information and Control 55 (1982) 80-82
4. Bondarenko A., Dung P.M., Kowalski R.A., and Toni F. An abstract, argumentation-theoretic approach to default reasoning. Artificial Intelligence 93 (1997) 63-101
5. Buhrman H., Kadin J., and Thierauf T. Functions computable with nonadaptive queries to NP. Theory Comput. Syst. 31 (1998) 77-92
6. Chang R., and Kadin J. On computing Boolean connectives of characteristic functions. Math. Syst. Theory 28 (1995) 173-198
7. Chang R., Kadin J., and Rohatgi P. On unique satisfiability and the threshold behavior of randomised reductions. J. Comput. System Sci. (1995) 359-373
8. Dimopoulos Y., Nebel B., and Toni F. Preferred arguments are harder to compute than stable extensions. In: Thomas D. (Ed). Proc. of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99, vol. 1) (1999), Morgan Kaufmann Publishers, San Francisco 36-43
9. Dimopoulos Y., Nebel B., and Toni F. Finding admissible and preferred arguments can be very hard. In: Cohn A.G., Giunchiglia F., and Selman B. (Eds). KR2000: Principles of Knowledge Representation and Reasoning (2000), Morgan Kaufmann, San Francisco 53-61
10. Dimopoulos Y., Nebel B., and Toni F. On the computational complexity of assumption-based argumentation for default reasoning. Artificial Intelligence 141 (2002) 55-78
11. Dimopoulos Y., and Torres A. Graph theoretical structures in logic programs and default theories. Theoret. Comput. Sci. 170 (1996) 209-244
12. Dung P.M. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and N-person games. Artificial Intelligence 77 (1995) 321-357
13. Dung P.M., Kowalski R.A., and Toni F. Dialectic proof procedures for assumption-based, admissible argumentation. Artificial Intelligence 170 (2006) 114-159
14. Dung P.M., Mancarella P., and Toni F. A dialectical procedure for sceptical assumption-based argumentation. In: Dunne P.E., and Bench-Capon T.J.M. (Eds). Proc. 1st Int. Conf. on Computational Models of Argument. Frontiers Artificial Intelligence Appl. vol. 144 (2006), IOS Press 145-156
15. Dung P.M., Mancarella P., and Toni F. Computing ideal sceptical argumentation. Artificial Intelligence 171 (2007) 642-674
16. Dunne P.E. Computational properties of argument systems satisfying graph-theoretic constraints. Artificial Intelligence 171 (2007) 701-729
17. Dunne P.E. The computational complexity of ideal semantics I: Abstract argumentation frameworks. Proc. 2nd Int. Conf. on Computational Models of Argument. Frontiers Artificial Intelligence Appl. vol. 172 (2008), IOS Press 147-158
18. P.E. Dunne, On constructing minimal formulae, Technical Report ULCS-09-011, Dept. of Comp. Sci., Univ. of Liverpool, April 2009, submitted for publication
19. Dunne P.E., and Bench-Capon T.J.M. Coherence in finite argument systems. Artificial Intelligence 141 (2002) 187-203
20. Dunne P.E., and Bench-Capon T.J.M. Two party immediate response disputes: Properties and efficiency. Artificial Intelligence 149 (2003) 221-250
21. Dunne P.E., and Wooldridge M. Complexity of abstract argumentation. In: Rahwan I., and Simari G. (Eds). Argumentation in Artificial Intelligence (2009), Springer-Verlag Chapter 5, pp. 85-104
22. p-complete. Theoret. Comput. Sci. 114 2 (1993) 231-245
23. p: Recent results and applications in AI and modal logic, in: Proc. FCT, 1997, pp. 1-18
24. K. Eshghi, R.A. Kowalski, Abduction compared with negation as failure, in: Proc. 6th Int. Conf. on Logic Programming, 1989, pp. 234-254
25. Gottlob G. Complexity results for nonmonotonic logics. J. Logic Comput. 2 3 (1992) 397-425
26. Jenner B., and Toran J. Computing functions with parallel queries to NP. Theoret. Comput. Sci. 141 (1995) 175-193
27. Johnson D.S. A catalogue of complexity classes. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity (1998), Elsevier Science 67-161
28. Konolige K. On the relation between default and autoepistemic logic. Artificial Intelligence 35 (1988) 343-382
29. Ladner R., Lynch N., and Selman A. Comparison of polynomial-time reducibilities. Theoret. Comput. Sci. 1 (1975) 103-123
30. Marx D. Complexity of unique list colorability. Technical report, Dept. of Comp. Science and Inf. Theory, Budapest Univ. of Tech. and Econ. (December 2007). http://www.cs.bme.hu/~dmarx/papers/marx-unique.pdf
31. Moore R.C. Semantical considerations on nonmonotonic logic. Artificial Intelligence 25 (1985) 75-94
32. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley
33. Reiter R. A logic for default reasoning. Artificial Intelligence 13 (1980) 81-132
34. Valiant L.G., and Vazirani V.V. NP is as easy as detecting unique solutions. Theoret. Comput. Sci. 47 (1986) 85-93
35. Vreeswijk G., and Prakken H. Credulous and sceptical argument games for preferred semantics. Proc. of JELIA'2000, The 7th European Workshop on Logic for Artificial Intelligence. Lecture Notes in Artificial Intelligence vol. 1919 (2000), Springer-Verlag, Berlin 224-238
36. K. Wagner, Bounded query computations, in: Proc. 3rd Conf. on Structure in Complexity Theory, 1988, pp. 260-277
37. Wagner K. Bounded query classes. SIAM J. Comput. 19 (1990) 833-846