{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T15:46:47Z","timestamp":1781279207040,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441908","type":"print"},{"value":"9783540457572","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45757-7_10","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T13:50:39Z","timestamp":1192888239000},"page":"111-124","source":"Crossref","is-referenced-by-count":19,"title":["Polynomial-Length Planning Spans the Polynomial Hierarchy"],"prefix":"10.1007","author":[{"given":"Hudson","family":"Turner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1111\/j.1467-8640.1995.tb00052.x","volume":"11","author":"C. B\u00e4ckstr\u00f6m","year":"1995","unstructured":"Christer B\u00e4ckstr\u00f6m and Bernhard Nebel. Complexity results for SAS+ planning. Computational Intelligence, 11(4):625\u2013655, 1995.","journal-title":"Computational Intelligence"},{"issue":"1\u20132","key":"10_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0004-3702(00)00043-6","volume":"122","author":"C. Baral","year":"2000","unstructured":"Chitta Baral, Vladik Kreinovich, and Raul Trejo. Computational complexity of planning and approximate planning in presence of incompleteness. Artificial Intelligence, 122(1\u20132):241\u2013267, 2000.","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"10_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T. Bylander","year":"1994","unstructured":"Tom Bylander. The computational complexity of propostional STRIPS planning. Artificial Intelligence, 69(1\u20132):165\u2013204, 1994.","journal-title":"Artificial Intelligence"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Giuseppe De Giacomo and Moshe Vardi. Automata-theoretic approach to planning for temporally extended goals. In Proc. of 5th European Conf. on Planning, 1999.","DOI":"10.1007\/10720246_18"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, and Axel Polleres. Planning under incomplete information. In Proc. Computational Logic 2000, 2000.","DOI":"10.1007\/3-540-44957-4_54"},{"issue":"1\u20131","key":"10_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0004-3702(94)00080-K","volume":"76","author":"K. Erol","year":"1995","unstructured":"Kutluhan Erol, Dana S. Nau, and V.S. Subrahmanian. Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence, 76(1\u20131):75\u201388, 1995.","journal-title":"Artificial Intelligence"},{"key":"10_CR7","unstructured":"Enrico Giunchiglia and Vladimir Lifschitz. An action language based on causal explanation: Preliminary report. In Proc. AAAI-98, pages 623\u2013630, 1998."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Patrik Haslum and Peter Jonsson. Some results on the complexity of planning with incomplete information. In Proc. of 5th European Conf. on Planning, 1999.","DOI":"10.1007\/10720246_24"},{"key":"10_CR9","unstructured":"Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. of the 10th European Conf. on Artificial Intelligence, pages 359\u2013379, 1992."},{"key":"10_CR10","unstructured":"Michael Littman. Probabilistic propositional planning: representations and complexity. In Proc. of AAAI-97, pages 748\u2013754, 1997."},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.505","volume":"9","author":"M. Littman","year":"1998","unstructured":"Michael Littman, Judy Goldsmith, and Martin Mundhenk. The computational complexity of probabilistic planning. Journal of Artificial Intelligence Research, 9:1\u201336, 1998.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10_CR12","unstructured":"Norman McCain and Hudson Turner. Causal theories of action and change. In Proc. of AAAI-97, pages 460\u2013465, 1997."},{"key":"10_CR13","unstructured":"Christos Papadimitriou. Computational Complexity. Addison Wesley, 1994."},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1613\/jair.591","volume":"10","author":"J. Rintanen","year":"1999","unstructured":"Jussi Rintanen. Constructing conditional plans by a theorem prover. Journal ofArtificial Intelligence Research, 10:323\u2013352, 1999.","journal-title":"Journal ofArtificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45757-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T18:08:01Z","timestamp":1556906881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45757-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441908","9783540457572"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45757-7_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}