The complexity of agent design problems: Determinism and history dependence

Annals of Mathematics and Artificial Intelligence

Volumn 45, Issue 3-4, 2005, Pages 343-371

  Wooldridge, Michael ^a   Dunne, Paul E ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Autonomous agents; Computational complexity

Indexed keywords

EID: 32544450438     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-005-9003-0     Document Type: Review

References (23)

1. J.F. Allen, J. Hendler, and A. Tate, eds., Readings in Planning (Morgan Kaufmann, San Mateo, California, 1990).
2. C. Baral, V. Kreinovich and R. Trejo, Computational complexity of planning and approximate planning in presence of incompleteness, in: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99) (Stockholm, Sweden, 1999).
3. T. Bylander, The computational complexity of prepositional STRIPS planning, Artificial Intelligence 69(1-2) (1994) 165-204.
4. P.E. Dunne, Computability Theory-Concepts and Applications (Ellis-Horwood, Chichester, England, 1991).
5. M. Euwe, Mengentheoretische Betrachten über das Schachspiel, Proceedings of the Koninklijke Akademie van Wetenschappen, Amsterdam 32 (1929) 633-642.
6. R.E. Fikes and N. Nilsson, STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence 2 (1971) 189-208.
7. L.M. Goldschlager, The monotone and planar circuit value problems are log space complete for P, SIGACT Newsletter 9(2) (1977) 25-29.
8. L.P. Kaelbling, M.L. Littman and A.R. Cassandra, Planning and acting in partially observable stochastic domains, Artificial Intelligence 101 (1998) 99-134.
9. V. Lifschitz, On the semantics of STRIPS, in: Reasoning About Actions and Plans - Proceedings of the 1986 Workshop, eds. M.P. Georgeff and A.L. Lansky (Morgan Kaufmann, San Mateo, California, 1986) pp. 1-10.
10. M.L. Littman, J. Goldsmith and M. Mundhenk, The computational complexity of probabilistic planning, Journal of Artificial Intelligence Research 9 (1998) 1-36.
11. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems (Springer, Berlin Heidelberg New York, 1992).
12. Z. Manna and A. Pnueli, Temporal Verification of Reactive Systems-Safety (Springer, Berlin Heidelberg New York, 1995).
13. M. Morse, Abstract 360: A solution of the problem of infinite play in chess, Bulletin of the American Mathematical Society 44 (1938) 632.
14. C.H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, Massachusetts, 1994).
15. C.H. Papadimitriou and M. Yannakakis, The complexity of facets (and some facets of complexity) in: Proceedings of the Fourteenth ACM Symposium on the Theory of Computing (STOC-82) (San Francisco, California, 1982), pp. 255-260.
16. A. Pnueli and R. Rosner, On the synthesis of s reactive module, in: Proceedings of the Sixteenth ACM Symposium on the Principle of Programming Language (POPL), January 1989, pp. 179-190.
17. A. Pnueli and R. Rosner, On the synthesis of an asynchronous reactive module, in: Proceedings of the Sixteenth International Colloquium on Automata, Languages, and Programs, 1989.
18. E. Prouhet, Mémoire sur quelques relations entre les puissances des nombres, R. Acad. Sci. Paris Sér. I 33 (1851) 225.
19. S. Russell and D. Subramanian, Provably bounded-optimal agents, Journal of Artificial Intelligence Research 2 (1995) 575-609.
20. A.P. Sistla and E.M. Clarke, The complexity of prepositional linear temporal logics, Journal of the ACM 32(3) (1985) 733-749.
21. A. Thue, Über unendliche Zeichenreihen, Norske Videnskabers Selskabs Skrifter I, Matematisk-Naturvidenskapelig Klasse. 7 (1906) 1-22.
22. M. Wooldridge, The computational complexity of agent design problems, in: Proceedings of the Fourth International Conference on Multi-Agent Systems (ICMAS-2000) (Boston, Massachusetts, 2000) pp. 341-348.
23. M. Wooldridge, N.R. Jennings, Intelligent agents: Theory and practice, The Knowledge Engineering Review 10(2) (1995) 115-152.