{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:40:22Z","timestamp":1725518422525},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540858447"},{"type":"electronic","value":"9783540858454"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85845-4_6","type":"book-chapter","created":{"date-parts":[[2008,9,22]],"date-time":"2008-09-22T02:57:04Z","timestamp":1222052224000},"page":"46-53","source":"Crossref","is-referenced-by-count":4,"title":["Limits and Possibilities of BDDs in State Space Search"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Kissmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Ball, M., Holte, R.C.: The compression power of symbolic pattern databases. In: ICAPS 2008 (to appear, 2008)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., Furst, M.L.: Fast planning through planning graph analysis. In: IJCAI, pp. 1636\u20131642 (1995)","DOI":"10.21236\/ADA303260"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bryant, R.E.: Symbolic manipulation of boolean functions using a graphical representation. In: DAC, pp. 688\u2013694 (1985)","DOI":"10.1109\/DAC.1985.1586017"},{"key":"6_CR4","unstructured":"Cimatti, A., Roveri, M., Traverso, P.: Automatic OBDD-based generation of universal plans in non-deterministic domains. In: AAAI, pp. 875\u2013881 (1998)"},{"key":"6_CR5","unstructured":"Edelkamp, S.: Symbolic shortest path planning. In: ICAPS Workshop on Heuristics for Domain-independent Planning: Progress, Ideas, Limitations, Challenges (2007)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/10720246_11","volume-title":"Recent Advances in AI Planning","author":"S. Edelkamp","year":"2000","unstructured":"Edelkamp, S., Helmert, M.: Exhibiting knowledge in planning problems to minimize state encoding length. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS, vol.\u00a01809, pp. 135\u2013147. Springer, Heidelberg (2000)"},{"key":"6_CR7","unstructured":"Edelkamp, S., Kissmann, P.: GAMER: Bridging planning and general game playing with symbolic search. In: Proceedings of the 6 th International Planning Competition (to appear, 2008)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Kissmann, P.: Limits and possibilities of BDDs in state space search. In: AAAI, pp. 1452\u20131453 (2008)","DOI":"10.1007\/978-3-540-85845-4_6"},{"key":"6_CR9","unstructured":"Edelkamp, S., Kissmann, P., Jabbar, S.: Scaling search with symbolic pattern databases. In: MOCHART 2008 (to appear, 2008)"},{"key":"6_CR10","unstructured":"Felner, A., Meshulam, R., Holte, R.C., Korf, R.E.: Compressing pattern databases. In: AAAI, pp. 638\u2013643 (2004)"},{"key":"6_CR11","unstructured":"Grandcolas, S., Pain-Barre, C.: Filtering, decomposition and search-space reduction in optimal sequential planning. In: AAAI, pp. 993\u2013998 (2007)"},{"key":"6_CR12","unstructured":"Haslum, P., Botea, A., Helmert, M., Bonet, B., Koenig, S.: Domain-independent construction of pattern database heuristics for cost-optimal planning. In: AAAI, pp. 1007\u20131012 (2007)"},{"key":"6_CR13","unstructured":"Helmert, M.: A planning heuristic based on causal graph analysis. In: ICAPS, pp. 161\u2013170 (2004)"},{"key":"6_CR14","unstructured":"Helmert, M., Haslum, P., Hoffmann, J.: Flexible abstraction heuristics for optimal sequential planning. In: ICAPS, pp. 176\u2013183 (2007)"},{"key":"6_CR15","unstructured":"Helmert, M., R\u00f6ger, G.: How good is almost perfect? In: AAAI, pp. 944\u2013949 (2008)"},{"key":"6_CR16","unstructured":"Hickmott, S.L., Rintanen, J., Thi\u00e9baux, S., White, L.B.: Planning via petri net unfolding. In: IJCAI, pp. 1904\u20131911 (2007)"},{"key":"6_CR17","unstructured":"Hung, N.N.W.: Exploiting symmetry for formal verification. Master\u2019s thesis, Faculty of the Graduate School, University of Texas at Austin (1997)"},{"key":"6_CR18","unstructured":"Jensen, R., Hansen, E., Richards, S., Zhou, R.: Memory-efficient symbolic heuristic search. In: ICAPS, pp. 304\u2013313 (2006)"},{"key":"6_CR19","unstructured":"Junghanns, A.: Pushing the Limits: New Developments in Single-Agent Search. PhD thesis, University of Alberta (1999)"},{"key":"6_CR20","unstructured":"Kautz, H., Selman, B.: Pushing the envelope: Planning propositional logic, and stochastic search. In: ECAI, pp. 1194\u20131201 (1996)"},{"key":"6_CR21","unstructured":"Kautz, H., Selman, B., Hoffmann, J.: Satplan: Planning as satisfiability. In: Proceedings of the 5 th International Planning Competition (2006)"},{"key":"6_CR22","unstructured":"Korf, R.E., Schultze, T.: Large-scale parallel breadth-first search. In: AAAI, pp. 1380\u20131385 (2005)"},{"key":"6_CR23","unstructured":"Robinson, N., Gretton, C., Pham, D.N., Sattar, A.: A compact and efficient SAT encoding for planning. In: ICAPS (to appear, 2008)"},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.artint.2005.08.004","volume":"170","author":"V. Vidal","year":"2006","unstructured":"Vidal, V., Geffner, H.: Branching and pruning: An optimal temporal POCL planner based on constraint programming. Artificial Intelligence\u00a0170(3), 298\u2013335 (2006)","journal-title":"Artificial Intelligence"},{"key":"6_CR25","unstructured":"Xing, Z., Chen, Y., Zhang, W.: MAXPLAN: Optimal Planning by Decomposed Satisfiability and Backward Reduction. In: Proceedings of the 5 th International Planning Competition (2006)"},{"key":"6_CR26","unstructured":"Zhou, R., Hansen, E.: Breadth-first heuristic search. In: ICAPS, pp. 92\u2013100 (2004)"}],"container-title":["Lecture Notes in Computer Science","KI 2008: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85845-4_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:51:38Z","timestamp":1619509898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85845-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540858447","9783540858454"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85845-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}