The computational complexity of agent design problems

Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000

Volumn , Issue , 2000, Pages 341-348

  Wooldridge, M ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; SOFTWARE AGENTS; SPECIFICATIONS;

AGENT DESIGN; AUTOMATIC SYNTHESIS; FORMAL MODEL; MAINTENANCE TASKS; PSPACE-COMPLETE; RELATED WORKS; TASK ENVIRONMENT;

MULTI AGENT SYSTEMS;

EID: 84962076667     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMAS.2000.858472     Document Type: Conference Paper

References (20)

1. J. F. Allen, J. Hendler, and A. Tate, editors. Readings in Planning. Morgan Kaufmann Publishers: San Mateo, CA, 1990.
2. K. Binmore. Fun and Games: A Text on Game Theory. D. C. Heath and Company: Lexington, MA, 1992.
3. J. Blythe. An overview of planning under uncertainty. In M. Wooldridge and M. Veloso, editors, Artificial Intelligence Today (LNAI 1600), pages 85-110. Springer-Verlag: Berlin, Germany, 1999.
4. T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.
5. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In D. Kozen, editor, Logics of Programs - Proceedings 1981 (LNCS Volume 131), pages 52-71. Springer-Verlag: Berlin, Germany, 1981.
6. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning About Knowledge. The MIT Press: Cambridge, MA, 1995.
7. R. E. Fikes and N. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 5(2):189-208, 1971.
8. M. Fisher. A survey of Concurrent METATEM - the lan guage and its applications. In D. M. Gabbay and H. J. Ohlbach, editors, Temporal Logic - Proceedings of the First International Conference (LNAI Volume 827), pages 480-505. Springer-Verlag: Berlin, Germany, July 1994.
9. M. R. Genesereth and N. Nilsson. Logical Foundations of Artificial Intelligence. Morgan Kaufmann Publishers: San Mateo, CA, 1987.
10. L. P. Kaelbling, M. L. Littman, and A. R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101:99-134, 1998.
11. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag: Berlin, Germany, 1992.
12. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems - Safety. Springer-Verlag: Berlin, Germany, 1995.
13. Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68-93, Jan. 1984.
14. C. H. Papadimitriou. Computational Complexity. Addison-Wesley: Reading, MA, 1994.
15. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proceedings of the Sixteenth ACM Symposium on the Principles of Programming Languages (POPL), pages 179-190, Jan. 1989.
16. S. Russell and D. Subramanian. Provably bounded-optimal agents. Journal of AI Research, 2:575-609, 1995.
17. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. Journal of the ACM, 32(3):733-749, 1985.
18. M. Tennenholtz and Y. Moses. On cooperation in a multientity model: Preliminary report. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89), Detroit, MI, 1989.
19. M. Wooldridge. Agent-based software engineering. IEE Proceedings on Software Engineering, 144(1):26-37, Feb. 1997.
20. M. Wooldridge and N. R. Jennings. Intelligent agents: Theory and practice. The Knowledge Engineering Review, 10(2):115-152, 1995.