{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T17:16:06Z","timestamp":1790702166139,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642046162","type":"print"},{"value":"9783642046179","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04617-9_1","type":"book-chapter","created":{"date-parts":[[2009,9,15]],"date-time":"2009-09-15T10:55:02Z","timestamp":1253012102000},"page":"1-8","source":"Crossref","is-referenced-by-count":7,"title":["Solving Fully-Observable Non-deterministic Planning Problems via Translation into a General Game"],"prefix":"10.1007","author":[{"given":"Peter","family":"Kissmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Edelkamp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Bakera, M., Edelkamp, S., Kissmann, P., Renner, C.D.: Solving \u03bc-calculus parity games by symbolic planning. In: MoChArt 2008. LNCS (LNAI), vol.\u00a05348, pp. 15\u201333. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-00431-5_2"},{"key":"1_CR2","unstructured":"Bercher, P., Mattm\u00fcller, R.: A planning graph heuristic for forward-chaining adversarial planning. In: ECAI, pp. 921\u2013922 (2008)"},{"key":"1_CR3","unstructured":"Bertoli, P., Cimatti, A., Pistore, M., Roveri, M., Traverso, P.: MBP: A model based planner. In: IJCAI Workshop on Planning under Uncertainty and Incomplete Information, pp. 93\u201397 (2001)"},{"issue":"8","key":"1_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"1_CR5","unstructured":"Bryce, D., Buffet, O.: 6th International Planning Competition: Uncertainty Part (2008)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11539452_9","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"F. Cassez","year":"2005","unstructured":"Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 66\u201380. Springer, Heidelberg (2005)"},{"issue":"1\u20132","key":"1_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0004-3702(02)00374-0","volume":"147","author":"A. Cimatti","year":"2003","unstructured":"Cimatti, A., Pistore, M., Roveri, M., Traverso, P.: Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence\u00a0147(1\u20132), 35\u201384 (2003)","journal-title":"Artificial Intelligence"},{"key":"1_CR8","first-page":"410","volume":"663","author":"R. Cleaveland","year":"1992","unstructured":"Cleaveland, R., Klein, M., Steffen, B.: Faster model checking for the modal \u03bc-calculus. Theoretical Computer Science\u00a0663, 410\u2013422 (1992)","journal-title":"Theoretical Computer Science"},{"key":"1_CR9","unstructured":"Edelkamp, S.: Symbolic exploration in two-player games: Preliminary results. In: AIPS 2002, Workshop on Model Checking, pp. 40\u201348 (2002)"},{"key":"1_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-85845-4_23","volume-title":"KI 2008: Advances in Artificial Intelligence","author":"S. Edelkamp","year":"2008","unstructured":"Edelkamp, S., Kissmann, P.: Symbolic classification of general two-player games. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds.) KI 2008. LNCS (LNAI), vol.\u00a05243, pp. 185\u2013192. Springer, Heidelberg (2008)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, \u03bc-calculus and determinacy. In: Foundations of Computer Science, pp. 368\u2013377 (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"1_CR12","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition","author":"M. Helmert","year":"2008","unstructured":"Helmert, M.: Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition. LNCS (LNAI), vol.\u00a04929. Springer, Heidelberg (2008)"},{"key":"1_CR13","unstructured":"Jensen, R.M., Veloso, M.M., Bowling, M.H.: Obdd-based optimistic and strong cyclic adversarial planning. In: ECP, pp. 265\u2013276 (2001)"},{"key":"1_CR14","unstructured":"Kissmann, P., Edelkamp, S.: Instantiating general games. In: IJCAI-Workshop on General Game Playing (2009)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0055040","volume-title":"Automata, Languages and Programming","author":"X. Liu","year":"1998","unstructured":"Liu, X., Smolka, S.A.: Simple linear-time algorithms for minimal fixed points. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 53\u201366. Springer, Heidelberg (1998)"},{"key":"1_CR16","unstructured":"Love, N.C., Hinrichs, T.L., Genesereth, M.R.: General game playing: Game description language specification. Technical Report LG-2006-01, Stanford Logic Group (April 2006)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"McMillan, K.L.: Temporal logic and model checking. In: Verification of Digital and Hybrid Systems, pp. 36\u201354 (1998)","DOI":"10.1007\/978-3-642-59615-5_3"}],"container-title":["Lecture Notes in Computer Science","KI 2009: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04617-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T04:49:34Z","timestamp":1739335774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04617-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046162","9783642046179"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04617-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}