{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:44:47Z","timestamp":1725745487947},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642409417"},{"type":"electronic","value":"9783642409424"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40942-4_13","type":"book-chapter","created":{"date-parts":[[2013,8,20]],"date-time":"2013-08-20T03:43:31Z","timestamp":1376970211000},"page":"140-151","source":"Crossref","is-referenced-by-count":1,"title":["Pattern-Database Heuristics for Partially Observable Nondeterministic Planning"],"prefix":"10.1007","author":[{"given":"Manuela","family":"Ortlieb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Mattm\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Bercher, P., Mattm\u00fcller, R.: A planning graph heuristic for forward-chaining adversarial planning. In: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 921\u2013922 (2008)"},{"key":"13_CR2","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-04617-9_8","volume-title":"KI 2009: Advances in Artificial Intelligence","author":"P. Bercher","year":"2009","unstructured":"Bercher, P., Mattm\u00fcller, R.: Solving non-deterministic planning problems with pattern database heuristics. In: Mertsching, B., Hund, M., Aziz, Z. (eds.) KI 2009. LNCS (LNAI), vol.\u00a05803, pp. 57\u201364. Springer, Heidelberg (2009)"},{"issue":"8","key":"13_CR3","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":"13_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10462-007-9034-5","volume":"26","author":"D. Bryce","year":"2006","unstructured":"Bryce, D., Kambhampati, S., Smith, D.E.: Planning graph heuristics for belief space search. Journal of Artificial Intelligence Research\u00a026, 35\u201399 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1-2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T. Bylander","year":"1994","unstructured":"Bylander, T.: The computational complexity of propositional strips planning. Artificial Intelligence\u00a069(1-2), 165\u2013204 (1994)","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"13_CR6","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-2), 35\u201384 (2003)","journal-title":"Artificial Intelligence"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-61291-2_68","volume-title":"Advances in Artificial Intelligence","author":"J.C. Culberson","year":"1996","unstructured":"Culberson, J.C., Schaeffer, J.: Searching with pattern databases. In: McCalla, G.I. (ed.) Canadian AI 1996. LNCS, vol.\u00a01081, pp. 402\u2013416. Springer, Heidelberg (1996)"},{"key":"13_CR8","unstructured":"Fu, J., Ng, V., Bastani, F.B., Yen, I.L.: Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems. In: Proc. 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 1949\u20131954 (2011)"},{"issue":"1-2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0004-3702(01)00106-0","volume":"129","author":"E.A. Hansen","year":"2001","unstructured":"Hansen, E.A., Zilberstein, S.: LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence\u00a0129(1-2), 35\u201362 (2001)","journal-title":"Artificial Intelligence"},{"key":"13_CR10","unstructured":"Haslum, P., Botea, A., Helmert, M., Bonet, B., Koenig, S.: Domain-independent construction of pattern database heuristics for cost-optimal planning. In: Proc. 22nd AAAI Conference on Artificial Intelligence (AAAI 2007), pp. 1007\u20131012 (2007)"},{"key":"13_CR11","unstructured":"Helmert, M., R\u00f6ger, G., Seipp, J., Karpas, E., Hoffmann, J., Keyder, E., Nissim, R., Richter, S., Westphal, M.: Fast downward stone soup (planner abstract). In: Seventh International Planning Competition (IPC 2011), Deterministic Part, pp. 38\u201345 (2011)"},{"key":"13_CR12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research\u00a014, 253\u2013302 (2001)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"13_CR13","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-04617-9_1","volume-title":"KI 2009: Advances in Artificial Intelligence","author":"P. Kissmann","year":"2009","unstructured":"Kissmann, P., Edelkamp, S.: Solving fully-observable non-deterministic planning problems via translation into a general game. In: Mertsching, B., Hund, M., Aziz, Z. (eds.) KI 2009. LNCS (LNAI), vol.\u00a05803, pp. 1\u20138. Springer, Heidelberg (2009)"},{"key":"13_CR14","unstructured":"Kuter, U., Nau, D.S., Reisner, E., Goldman, R.P.: Using classical planners to solve nondeterministic planning problems. In: Proc. 18th International Conference on Automated Planning and Scheduling (ICAPS 2008), pp. 190\u2013197 (2008)"},{"key":"13_CR15","unstructured":"Littman, M.L.: Probabilistic propositional planning: Representations and complexity. In: Proc. 14th National Conference on Artificial Intelligence (AAAI 1997), pp. 748\u2013754. MIT Press (1997)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Mattm\u00fcller, R., Ortlieb, M., Helmert, M., Bercher, P.: Pattern database heuristics for fully observable nondeterministic planning. In: Proc. 20th International Conference on Automated Planning and Scheduling (ICAPS 2010), pp. 105\u2013112 (2010)","DOI":"10.1609\/icaps.v20i1.13408"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theoretical Computer Science\u00a084, 127\u2013150 (1991)","journal-title":"Theoretical Computer Science"},{"key":"13_CR18","unstructured":"Richter, S., Westphal, M., Helmert, M.: Lama 2008 and 2011 (planner abstract). In: Seventh International Planning Competition (IPC 2011), Deterministic Part, pp. 50\u201354 (2011)"},{"key":"13_CR19","unstructured":"Rintanen, J.: Complexity of planning with partial observability. In: Proc. 14th International Conference on Automated Planning and Scheduling (ICAPS 2004), pp. 345\u2013354 (2004)"}],"container-title":["Lecture Notes in Computer Science","KI 2013: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40942-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T23:21:31Z","timestamp":1688426491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40942-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409417","9783642409424"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40942-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}