{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T21:04:02Z","timestamp":1772831042096,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424222","type":"print"},{"value":"9783540446316","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44631-1_1","type":"book-chapter","created":{"date-parts":[[2007,8,7]],"date-time":"2007-08-07T02:24:08Z","timestamp":1186453448000},"page":"1-14","source":"Crossref","is-referenced-by-count":7,"title":["Optimistic and Disjunctive Agent Design Problems"],"prefix":"10.1007","author":[{"given":"Michael","family":"Wooldridge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul E.","family":"Dunne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"1_CR1","volume-title":"Readings in Planning","year":"1990","unstructured":"J. F. Allen, J. Hendler, and A. Tate, editors. Readings in Planning. Morgan Kaufmann Publishers: San Mateo, CA, 1990."},{"key":"1_CR2","unstructured":"K. Binmore. Fun and Games: A Text on Game Theory. D. C. Heath and Company: Lexington, MA, 1992."},{"issue":"1\u20132","key":"1_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T. Bylander","year":"1994","unstructured":"T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1\u20132):165\u2013204, 1994.","journal-title":"Artificial Intelligence"},{"key":"1_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Design and synthesis of synchronization skeletons using branching time temporal logic","author":"E.M. Clarke","year":"1982","unstructured":"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\u2014Proceedings 1981 (LNCSVolume 131), pages 52\u201371. Springer-Verlag: Berlin, Germany, 1981."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning About Knowledge. The MIT Press: Cambridge, MA, 1995.","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"1_CR6","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of np-Completeness. W. H. Freeman: NewYork, 1979."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0004-3702(98)00023-X","volume":"101","author":"L. P. Kaelbling","year":"1998","unstructured":"L. P. Kaelbling, M. L. Littman, and A. R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101:99\u2013134, 1998.","journal-title":"Artificial Intelligence"},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02856444","volume":"9","author":"M. L. Littman","year":"1998","unstructured":"M. L. Littman, J. Goldsmith, and M. Mundhenk. The computational complexity of probabilistic planning. Journal of AI Research, 9:1\u201336, 1998.","journal-title":"Journal of AI Research"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag: Berlin, Germany, 1992.","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. TemporalVerification of Reactive Systems\u2014Safety. Springer-Verlag: Berlin, Germany, 1995.","DOI":"10.1007\/978-1-4612-4222-2"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/357233.357237","volume":"6","author":"Z. Manna","year":"1984","unstructured":"Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic speci-fications. ACM Transactions on Programming Languages and Systems, 6(1):68\u201393, January 1984.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR12","unstructured":"C. H. Papadimitriou. Computational Complexity. Addison-Wesley: Reading, MA, 1994."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013190, January 1989.","DOI":"10.1145\/75277.75293"},{"key":"1_CR14","first-page":"575","volume":"2","author":"S. Russell","year":"1995","unstructured":"S. Russell and D. Subramanian. Provably bounded-optimal agents. Journal of AI Research, 2:575\u2013609, 1995.","journal-title":"Journal of AI Research"},{"key":"1_CR15","unstructured":"M. Tennenholtz and Y. Moses. On cooperation in a multi-entity model: Preliminary report. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89), Detroit, MI, 1989."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"M. Wooldridge. The computational complexity of agent design problems. In Proceedings of the Fourth International Conference on Multi-Agent Systems (ICMAS-2000), pages 341\u2013348, Boston, MA, 2000.","DOI":"10.1109\/ICMAS.2000.858472"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1017\/S0269888900008122","volume":"10","author":"M. Wooldridge","year":"1995","unstructured":"M. Wooldridge and N. R. Jennings. Intelligent agents: Theory and practice. The Knowledge Engineering Review, 10(2):115\u2013152, 1995.","journal-title":"The Knowledge Engineering Review"}],"container-title":["Lecture Notes in Computer Science","Intelligent Agents VII Agent Theories Architectures and Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44631-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T04:50:30Z","timestamp":1737348630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44631-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424222","9783540446316"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44631-1_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}