The computational complexity of agent design problems
- 7 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A survey of concurrent MetateM — The language and its applicationsPublished by Springer Nature ,2005
- An Overview of Planning Under UncertaintyPublished by Springer Nature ,1999
- Planning and acting in partially observable stochastic domainsPublished by Elsevier ,1998
- Agent-based software engineeringIEE Proceedings - Software Engineering, 1997
- Temporal Verification of Reactive SystemsPublished by Springer Nature ,1995
- The computational complexity of propositional STRIPS planningArtificial Intelligence, 1994
- The Temporal Logic of Reactive and Concurrent SystemsPublished by Springer Nature ,1992
- On the synthesis of a reactive modulePublished by Association for Computing Machinery (ACM) ,1989
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- Synthesis of Communicating Processes from Temporal Logic SpecificationsACM Transactions on Programming Languages and Systems, 1984