{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:58:59Z","timestamp":1775818739861,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540678663","type":"print"},{"value":"9783540446576","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10720246_11","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T16:15:39Z","timestamp":1167408939000},"page":"135-147","source":"Crossref","is-referenced-by-count":12,"title":["Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malte","family":"Helmert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Blum, A., Furst, M.: Fast planning through planning graph analysis. In: IJCAI 1995, pp. 1636\u20131642 (1995)","DOI":"10.21236\/ADA303260"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bryant, R.E.: Symbolic manipulation of boolean functions using a graphical representation. ACM\/IEEE Design Automation, 688\u2013694 (1985)","DOI":"10.1109\/DAC.1985.1586017"},{"key":"11_CR3","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":"11_CR4","doi-asserted-by":"crossref","unstructured":"Eckerle, J., Schuierer, S.: Efficient memory-limited graph search. LNCS, vol.\u00a0981, pp. 101\u2013112 (1995)","DOI":"10.1007\/3-540-60343-3_29"},{"key":"11_CR5","unstructured":"Edelkamp, S., Korf, R.E.: The branching factor of regular search spaces. In: AAAI 1998, pp. 299\u2013304 (1998)"},{"key":"11_CR6","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BFb0095430","volume-title":"KI-98: Advances in Artificial Intelligence","author":"S. Edelkamp","year":"1998","unstructured":"Edelkamp, S., Reffel, F.: OBDDs in heuristic search. In: Herzog, O. (ed.) KI 1998. LNCS (LNAI), vol.\u00a01504, pp. 81\u201392. Springer, Heidelberg (1998)"},{"key":"11_CR7","unstructured":"Edelkamp, S., Reffel, F.: Deterministic state space planning with BDDs. Technical Report 120, Computer Science Departement, University of Freiburg (1999)"},{"key":"11_CR8","unstructured":"Fikes, R., Nilsson, N.: Strips: A new approach to the application of theorem proving to problem solving"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1613\/jair.544","volume":"9","author":"M. Fox","year":"1998","unstructured":"Fox, M., Long, D.: The automatic inference of state invariants in TIM. JAIR\u00a09, 367\u2013421 (1998)","journal-title":"in TIM. JAIR"},{"key":"11_CR10","unstructured":"Fox, M., Long, D.: The detection and exploration of symmetry in planning problems. Technical Report 1\/99, Department of Computer Science, University of Durham (1999)"},{"key":"11_CR11","first-page":"905","volume-title":"AAAI 1998","author":"A. Gerevini","year":"1998","unstructured":"Gerevini, A., Schubert, L.: Inferring state constraints for domain-independent planning. In: AAAI 1998, pp. 905\u2013912. AAAI Press, Menlo Park (1998)"},{"key":"11_CR12","first-page":"100","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for heuristic determination of minimum path cost. IEEE Trans. on SSC\u00a04, 100 (1968)","journal-title":"IEEE Trans. on SSC"},{"key":"11_CR13","unstructured":"Junghanns, A., Schaeffer, J.: Single agent search in the presence of deadlocks. In: AAAI 1998, pp. 228\u2013233 (1998)"},{"key":"11_CR14","unstructured":"Kautz, H., Selman, B.: Pushing the envelope: Planning propositional logic, and stochastic search. In: AAAI 1996, pp. 1194\u20131201 (1996)"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.E. Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence\u00a027(1), 97\u2013109 (1985)","journal-title":"Artificial Intelligence"},{"key":"11_CR16","unstructured":"Korf, R.E.: Finding optimal solutions to Rubik\u2019s Cube using pattern databases. In: AAAI 1997, pp. 700\u2013705 (1997)"},{"key":"11_CR17","unstructured":"Korf, R.E.: Complexity analysis of admissible heuristic search. In: AAAI 1998, pp. 305\u2013310 (1998)"},{"key":"11_CR18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1613\/jair.570","volume":"10","author":"D. Long","year":"1998","unstructured":"Long, D., Fox, M.: Efficient implementation of the plan graph in STAN. JAIR\u00a010, 87\u2013115 (1998)","journal-title":"in STAN. JAIR"},{"key":"11_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K. McMillan","year":"1993","unstructured":"McMillan, K.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)"},{"key":"11_CR20","unstructured":"Pednould, E.: ADL: Exploring the middleground between Strips and situation calculus. In: KR 1989, pp. 324\u2013332 (1989)"},{"issue":"7","key":"11_CR21","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/34.297950","volume":"16","author":"A. Reinefeld","year":"1994","unstructured":"Reinefeld, A., Marsland, T.: Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a016(7), 701\u2013710 (1994)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"11_CR22","first-page":"1","volume-title":"ECAI 1992","author":"S. Russell","year":"1992","unstructured":"Russell, S.: Efficient memory-bounded search methods. In: ECAI 1992, pp. 1\u20135. Wiley, Chichester (1992)"},{"key":"11_CR23","unstructured":"Taylor, L.A., Korf, R.E.: Pruning duplicate nodes in depth-first search. In: AAAI 1993, pp. 756\u2013761 (1993)"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in AI Planning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10720246_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T11:38:18Z","timestamp":1556019498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10720246_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678663","9783540446576"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/10720246_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}