{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:50:17Z","timestamp":1725511817931},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540696087"},{"type":"electronic","value":"9783540696117"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/978-3-540-69611-7_4","type":"book-chapter","created":{"date-parts":[[2007,4,26]],"date-time":"2007-04-26T09:40:18Z","timestamp":1177580418000},"page":"65-79","source":"Crossref","is-referenced-by-count":1,"title":["Instantly Turning a Naive Exhaustive Search into Three Efficient Searches with Pruning"],"prefix":"10.1007","author":[{"given":"Takeshi","family":"Morimoto","sequence":"first","affiliation":[]},{"given":"Yasunao","family":"Takano","sequence":"additional","affiliation":[]},{"given":"Hideya","family":"Iwasaki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"Introduction to Functional Programming using Haskell","author":"R. Bird","year":"1998","unstructured":"Bird, R.: Introduction to Functional Programming using Haskell. Prentice-Hall, Englewood Cliffs (1998)"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1017\/S0956796800000046","volume":"1","author":"F.W. Burton","year":"1991","unstructured":"Burton, F.W.: Encapsulating Non-determinacy in an Abstract Data Type with Determinate Semantics. Journal of Functional Programming\u00a01(1), 3\u201320 (1991)","journal-title":"Journal of Functional Programming"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1017\/S0956796804005040","volume":"14","author":"M. Erwig","year":"2004","unstructured":"Erwig, M.: Escape from Zurg: An Exercise in Logic Programming. Journal of Functional Programming\u00a014(3), 253\u2013261 (2004)","journal-title":"Journal of Functional Programming"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"R.E. Hart","year":"1968","unstructured":"Hart, R.E., Nilsson, N.J., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"4_CR6","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited Discrepancy Search. In: Proc. International Joint Conference on Artificial Intelligence, IJCAI 1995, pp. 607\u2013613 (1995)"},{"key":"4_CR7","unstructured":"Horowitz, E., Sahni, S.: Fundamentals of Computer Algorithms. Computer Science Press (1978)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Hughes, R.J.M., Swierstra, S.D.: Polish Parsers, Step by Step. In: Proc. International Conference on Functional Programming, ICFP 2003, pp. 239\u2013248 (2003)","DOI":"10.1145\/944705.944727"},{"key":"4_CR9","unstructured":"Iwasaki, H.: Pruning Unnecessary Computations using Improving Sequences. In: Proc. Asian Workshop on Programming Languages and Systems, APLAS 2002, pp. 46\u201357 (2002)"},{"key":"4_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":"Korf, R.E.: Depth-First Iterative Deepening: An Optimal Admissible Tree Search. Artificial Intelligence\u00a027, 97\u2013109 (1985)","journal-title":"Artificial Intelligence"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"4","author":"E.L. Lawler","year":"1966","unstructured":"Lawler, E.L., Woods, D.: Branch-and-Bound Methods: A Survey. Operations Research 14, 4, 699\u2013719 (1966)","journal-title":"Operations Research 14"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P., Michel, L.: Non-deterministic Control for Hybrid Search. In: Proc. International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CP-AI-OR 2005, pp. 380\u2013395 (2005)","DOI":"10.1007\/11493853_28"},{"key":"4_CR13","first-page":"434","volume-title":"Proc. National Conference on Artificial Intelligence, AAAI 1991","author":"N.R. Vempaty","year":"1991","unstructured":"Vempaty, N.R., Kumar, V., Korf, R.E.: Depth-First vs Best-First Search. In: Proc. National Conference on Artificial Intelligence, AAAI 1991, pp. 434\u2013440. AAAI Press, Menlo Park (1991)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69611-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:01:46Z","timestamp":1605762106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69611-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540696087","9783540696117"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69611-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}