{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:41Z","timestamp":1740123881687,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,7,9]],"date-time":"2016-07-09T00:00:00Z","timestamp":1468022400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Institute of General Medical Sciences of the National Institutes of Health Through","award":["8P20GM103447"],"award-info":[{"award-number":["8P20GM103447"]}]},{"DOI":"10.13039\/100008569","name":"Oklahoma Center for the Advancement of Science and Technology","doi-asserted-by":"publisher","award":["OCAST HR12-036"],"award-info":[{"award-number":["OCAST HR12-036"]}],"id":[{"id":"10.13039\/100008569","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10472-016-9517-7","type":"journal-article","created":{"date-parts":[[2016,7,9]],"date-time":"2016-07-09T11:38:40Z","timestamp":1468064320000},"page":"131-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast strong planning for fully observable nondeterministic planning problems"],"prefix":"10.1007","volume":"78","author":[{"given":"Jicheng","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andres","family":"Calderon Jaramillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farokh B.","family":"Bastani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I-Ling","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,9]]},"reference":[{"key":"9517_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.505","volume":"9","author":"ML Littman","year":"1998","unstructured":"Littman, M.L., Goldsmith, J., Mundhenk, M.: The computational complexity of probabilistic planning. J. Artif. Intell. Res. 9, 1\u201336 (1998)","journal-title":"J. Artif. Intell. Res."},{"key":"9517_CR2","unstructured":"Kuter, U., Nau, D., Reisner, E., Goldman, R.P.: \u201cUsing classical planners to solve nondeterministic planning problems\u201d. In: Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS) (2008)"},{"key":"9517_CR3","unstructured":"Levesque, H.J.: Planning with loops. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp 509\u2013515 (2005)"},{"key":"9517_CR4","unstructured":"Mattm\u00fcller, D.-I.R.: \u201cInformed Progression Search for Fully Observable Nondeterministic Planning,\u201d Ph.D. Dissertation, Universit\u00e4tsbibliothek Freiburg (2013)"},{"key":"9517_CR5","doi-asserted-by":"crossref","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. Artif. Intell. 147, 35\u201384 (2003)","journal-title":"Artif. Intell."},{"key":"9517_CR6","doi-asserted-by":"crossref","unstructured":"Kissmann, P., Edelkamp, S.: \u201cSolving fully-observable non-deterministic planning problems via translation into a general game\u201d. In: Mertsching, B., Hund, M., Aziz, Z. (eds.) KI 2009: Advances in Artificial Intelligence, vol. 5803, pp 1\u20138. Springer, Berlin, Heidelberg (2009)","DOI":"10.1007\/978-3-642-04617-9_1"},{"key":"9517_CR7","unstructured":"Fu, J., Ng, V., Bastani, F., Yen, I.-L.: Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp 1949\u20131954 (2011)"},{"key":"9517_CR8","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. J. Artif. Intell. Res. 14, 253\u2013302 (2001)","journal-title":"J. Artif. Intell. Res."},{"key":"9517_CR9","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.artint.2014.07.007","volume":"216","author":"R Alford","year":"2014","unstructured":"Alford, R., Kuter, U., Nau, D., Goldman, R.P.: Plan aggregation for strong cyclic planning in nondeterministic domains. Artif. Intell. 216, 206\u2013232 (2014)","journal-title":"Artif. Intell."},{"key":"9517_CR10","doi-asserted-by":"crossref","unstructured":"Muise, C.J., McIlraith, S.A., Beck, J.C.: \u201cImproved non-deterministic planning by exploiting state relevance\u201d. In: Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS) (2012)","DOI":"10.1609\/icaps.v22i1.13520"},{"key":"9517_CR11","unstructured":"Edelkamp, S., Kissmann, P.: Optimal symbolic planning with action costs and preferences. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp 1690\u20131695 (2009)"},{"key":"9517_CR12","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1613\/jair.774","volume":"13","author":"A Cimatti","year":"2000","unstructured":"Cimatti, A., Roveri, M.: Conformant planning via symbolic model checking. J. Artif. Intell. Res. 13, 305\u2013338 (2000)","journal-title":"J. Artif. Intell. Res."},{"key":"9517_CR13","unstructured":"Shaparau, D., Pistore, M., Traverso, P.: Contingent planning with goal preferences. In: Proceedings of the National Conference on Artificial Intelligence, pp 927\u2013934 (2006)"},{"key":"9517_CR14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.artint.2006.01.004","volume":"170","author":"P Bertoli","year":"2006","unstructured":"Bertoli, P., Cimatti, A., Roveri, M., Traverso, P.: Strong planning under partial observability. Artif. Intell. 170, 337\u2013384 (2006)","journal-title":"Artif. Intell."},{"key":"9517_CR15","unstructured":"Pistore, M., Traverso, P.: Planning as model checking for extended goals in non-deterministic domains. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp 479\u2013486 (2001)"},{"key":"9517_CR16","unstructured":"Dal Lago, U., Pistore, M., Traverso, P.: Planning with a language for extended goals. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp 447\u2013454 (2002)"},{"key":"9517_CR17","unstructured":"Edelkamp, S.: Symbolic pattern databases in heuristic search planning. In: Proceedings of the Artificial Intelligence Planning Systems Conference, pp 274\u2013283 (2002)"},{"key":"9517_CR18","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Kissmann, P., Torralba, A.: BDDS strike back (in AI planning). In: Proceedings of the AAAI Conference on Artificial Intelligence, pp 4320\u20134321 (2015)","DOI":"10.1609\/aaai.v29i1.9349"},{"key":"9517_CR19","unstructured":"Kuter, U., Nau, D.: Forward-chaining planning in nondeterministic domains. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp 513\u2013518 (2004)"},{"key":"9517_CR20","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1016\/j.artint.2008.11.012","volume":"173","author":"U Kuter","year":"2009","unstructured":"Kuter, U., Nau, D., Pistore, M., Traverso, P.: Task decomposition on abstract states, for planning under nondeterminism. Artif. Intell. 173, 669\u2013695 (2009)","journal-title":"Artif. Intell."},{"key":"9517_CR21","doi-asserted-by":"crossref","unstructured":"Jaramillo, A.C., Fu, J., Ng, V., Bastani, F.B., Yen, I.-L.: Fast strong planning for FOND problems with multi-root directed acyclic graphs. Int. J. Artif. Intell. Tools. 23 (2014)","DOI":"10.1142\/S0218213014600288"},{"key":"9517_CR22","unstructured":"Hoffmann, J., Brafman, R.: \u201cContingent planning via heuristic forward search with implicit belief states\u201d. In: Proceedings of the International Conference on Automated Planning and Scheduling (2005)"},{"key":"9517_CR23","unstructured":"Bryce, D., Buffet, O.: \u201c6Th International planning competition: uncertainty part\u201d. In: Proceedings of the International Planning Competition (2008)"},{"key":"9517_CR24","doi-asserted-by":"crossref","unstructured":"Bryce, D., Buffet, O.: The Uncertainty Part of the 6th International Planning Competition 2008 (IPPC). Available: http:\/\/ippc-2008.loria.fr\/wiki\/index.html (2008)","DOI":"10.1016\/S1364-5439(08)70017-0"},{"key":"9517_CR25","doi-asserted-by":"crossref","unstructured":"Tarjan, R.: \u201cDepth-first search and linear graph algorithms\u201d. In: Switching and Automata Theory, 12th Annual Symposium, pp 114\u2013121 (1971)","DOI":"10.1109\/SWAT.1971.10"},{"key":"9517_CR26","unstructured":"Bryce, D., Buffet, O.: \u201cInternational planning competition uncertainty part: benchmarks and results\u201d. In: Proceedings of the International Planning Competition (2008)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-016-9517-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-016-9517-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-016-9517-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T05:10:00Z","timestamp":1692421800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-016-9517-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,9]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9517"],"URL":"https:\/\/doi.org\/10.1007\/s10472-016-9517-7","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2016,7,9]]}}}