{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:59:55Z","timestamp":1775818795991,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540650805","type":"print"},{"value":"9783540496564","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0095430","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T09:28:18Z","timestamp":1164360498000},"page":"81-92","source":"Crossref","is-referenced-by-count":41,"title":["OBDDs in heuristic search"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Reffel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,20]]},"reference":[{"key":"8_CR1","unstructured":"A. Biere. Efficient model checking with binary decision diagramms. PhD thesis, Computer Science Department, University of Karlsruhe, 1997."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"A. Biere. \u03bccke-efficient \u03bc-calculus model checking. In Computer Aided Verification, volume 1254 of LNCS, pages 468\u2013471, 1997.","DOI":"10.1007\/3-540-63166-6_50"},{"key":"8_CR3","first-page":"688","volume-title":"Proceedings of the 22nd ACM\/IEEE Design Automation Conference","author":"R. E. Bryant","year":"1985","unstructured":"R. E. Bryant. Symbolic manipulation of boolean functions using a graphical representation. In Proceedings of the 22nd ACM\/IEEE Design Automation Conference, pages 688\u2013694, Los Alamitos, Ca., USA, 1985. IEEE Computer Society Press."},{"key":"8_CR4","first-page":"402","volume-title":"Proceedings of the Eleventh Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence","author":"J. C. Culberson","year":"1996","unstructured":"J. C. Culberson and J. Schaeffer. Searching with pattern databases. In Proceedings of the Eleventh Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence, volume 1081 of LNAI, pages 402\u2013416, Berlin, 1996. Springer."},{"key":"8_CR5","unstructured":"J. Doppelhamer and J. K. Lehnert. Optimal solution for sokoban using OBDDs. University of Trier, available from the authors, 1998."},{"key":"8_CR6","first-page":"101","volume":"981","author":"J. Eckerle","year":"1995","unstructured":"J. Eckerle and S. Schuierer. Efficient memory-limited graph search. LNCS, 981:101\u2013112, 1995.","journal-title":"LNCS"},{"key":"8_CR7","first-page":"100","volume":"4","author":"P. E. Hart","year":"1968","unstructured":"P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for heuristic determination of minimum path cost. IEEE Trans. on SSC, 4:100, 1968.","journal-title":"IEEE Trans. on SSC"},{"key":"8_CR8","unstructured":"A. Junghanns and J. Schaeffer. Single agent search in the presence of deadlocks. To appear in: Proceedings AAAI-98, 1998."},{"key":"8_CR9","unstructured":"A. Junghanns and J. Schaeffer. Sokoban: Evaluating standard single-agent search techniques in the presence of deadlock. To appear in: Proceedings CSCSI-98, Vancouver, Canada, LNCS, Springer, 1998."},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. E. Korf","year":"1985","unstructured":"R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97\u2013109, 1985.","journal-title":"Artificial Intelligence"},{"key":"8_CR11","unstructured":"R. E. Korf. Finding optimal solutions to Rubik\u2019s cube using pattern databases. In Proceedings AAAI-97, pages 700\u2013705. AAAI Press, 1997."},{"key":"8_CR12","unstructured":"R. E. Korf and L. A. Taylor. Finding optimal solutions to the twenty-four puzzle. In Proceedings AAAI-96, pages 1202\u20131207. AAAI Press, 1996."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"K. McMillan. Symbolic Model Checking. Kluwer Academic Press, 1993.","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"8_CR14","unstructured":"S. Russell. Efficient memory-bounded search methods. In Proceedings of ECAI-92, pages 1\u20135. Wiley, 1992."},{"key":"8_CR15","unstructured":"L. A. Taylor and R. E. Korf. Pruning duplicate nodes in depth-first search. In AAAI-93, pages 756\u2013761. AAAI Press, 1993."}],"container-title":["Lecture Notes in Computer Science","KI-98: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0095430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T10:54:17Z","timestamp":1555930457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0095430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650805","9783540496564"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0095430","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}