{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:27:01Z","timestamp":1761596821497,"version":"3.40.5"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1024452529781","type":"journal-article","created":{"date-parts":[[2003,9,15]],"date-time":"2003-09-15T17:22:37Z","timestamp":1063646557000},"page":"19-39","source":"Crossref","is-referenced-by-count":26,"title":["KBFS: K-Best-First Search"],"prefix":"10.1007","volume":"39","author":[{"given":"Ariel","family":"Felner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarit","family":"Kraus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard E.","family":"Korf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"5118308_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0004-3702(89)90010-6","volume":"41","author":"P.P. Chakrabarti","year":"1989","unstructured":"P.P. Chakrabarti, S. Ghose, A. Acharya and S.C. de Sarkar, Heuristic search in restricted memory, Artificial Intelligence 41(2) (1989) 197\u2013221.","journal-title":"Artificial Intelligence"},{"key":"5118308_CR2","first-page":"19","volume":"3","author":"H.W. Davis","year":"1989","unstructured":"H.W. Davis, A. Bramanti-Gregor and J. Wang, The advantages of using depth and breadth components in heuristic search, Methodologies for Intelligent Systems 3 (1989) 19\u201328.","journal-title":"Methodologies for Intelligent Systems"},{"issue":"3","key":"5118308_CR3","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/3828.3830","volume":"32","author":"R. Dechter","year":"1985","unstructured":"R. Dechter and J. Pearl, Generalized best-first search strategies and the optimality of A*, Journal of the Association for Computing Machinery 32(3) (1985) 505\u2013536.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"5118308_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1 (1959) 269\u2013271.","journal-title":"Numerische Mathematik"},{"issue":"2","key":"5118308_CR5","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1006\/jpdc.1995.1036","volume":"25","author":"M. Evett","year":"1995","unstructured":"M. Evett, J. Hendler, A. Mahanti and D.S. Nau, PRA*: Massively parallel heuristic search, Journal of Parallel and Distributed Computing 25(2) (1995) 92\u2013103.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"5118308_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NPCompleteness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness (Freeman, San Francisco, CA, 1979)."},{"key":"5118308_CR7","volume-title":"Performance measurement and analysis of certain search algorithms","author":"J. Gasching","year":"1979","unstructured":"J. Gasching, Performance measurement and analysis of certain search algorithms, Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA (1979)."},{"issue":"2","key":"5118308_CR8","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"P.E. Hart, N.J. Nilsson and B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Transactions on Systems Science and Cybernetics 4(2) (1968) 100\u2013107.","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"5118308_CR9","unstructured":"W.D. Harvey and M.L. Ginsberg, Limited discrepancy search, in: Proc. of IJCAI-95, Montreal, Canada (1995) pp. 607\u2013613."},{"key":"5118308_CR10","unstructured":"A. Junghanns and J. Schaeffer, Domain-dependent single-agent search enhancements, in: Proc. of IJCAI-99, Stockholm, Sweden (1999) pp. 570\u2013575."},{"key":"5118308_CR11","unstructured":"N. Karmarkar and R.M. Karp, The differencing method of set partitioning, Technical Report, UCB\/CSD 82\/113 (1982)."},{"issue":"1\u20132","key":"5118308_CR12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0004-3702(83)80006-X","volume":"21","author":"R. Karp","year":"1983","unstructured":"R. Karp and J. Pearl, Searching for an optimal path in a tree with random costs, Artificial Intelligence 21(1\u20132) (1983) 99\u2013116.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"5118308_CR13","doi-asserted-by":"crossref","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) (1985) 97\u2013109.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"5118308_CR14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","volume":"62","author":"R.E. Korf","year":"1993","unstructured":"R.E. Korf, Linear-space best-first search, Artificial Intelligence 62(1) (1993) 41\u201378.","journal-title":"Artificial Intelligence"},{"key":"5118308_CR15","unstructured":"R.E. Korf, Improved limited discrepancy search, in: Proc. of AAAI-96, Portland, OR (1996) pp. 286\u2013291."},{"issue":"2","key":"5118308_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0004-3702(98)00086-1","volume":"106","author":"R.E. Korf","year":"1998","unstructured":"R.E. Korf, A complete anytime algorithm for number partitioning, Artificial Intelligence 106(2) (1998) 181\u2013203.","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"5118308_CR17","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0004-3702(95)00096-8","volume":"84","author":"R.E. Korf","year":"1996","unstructured":"R.E. Korf and D.M. Chickering, Best-first minimax search, Artificial Intelligence 84(1\u20132) (1996) 299\u2013337.","journal-title":"Artificial Intelligence"},{"key":"5118308_CR18","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0004-3702(01)00092-3","volume":"134","author":"R.E. Korf","year":"2002","unstructured":"R.E. Korf and A. Felner, Disjoint pattern database heuristics, Artificial Intelligence 134 (2002) 9\u201322.","journal-title":"Artificial Intelligence"},{"key":"5118308_CR19","unstructured":"P. Meseguer, Interleaved depth-first search, in: Proc. of IJCAI-97 (1997) pp. 1382\u20131387."},{"issue":"1\u20132","key":"5118308_CR20","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0004-3702(83)80011-3","volume":"21","author":"D.S. Nau","year":"1983","unstructured":"D.S. Nau, Pathology on game trees revisited, and an alternative to minimaxing, Artificial Intelligence 21(1\u20132) (1983) 221\u2013244.","journal-title":"Artificial Intelligence"},{"key":"5118308_CR21","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0004-3702(70)90007-X","volume":"1","author":"I. Pohl","year":"1971","unstructured":"I. Pohl, Heuristic search viewed as path finding in a graph, Artificial Intelligence 1 (1971) 193\u2013204.","journal-title":"Artificial Intelligence"},{"issue":"5","key":"5118308_CR22","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1109\/34.134045","volume":"13","author":"C. Powley","year":"1991","unstructured":"C. Powley and R.E. Korf, Single-agent parallel window search, IEEE Transactions on Pattern Analysis and Machine Intelligence 13(5) (1991) 466\u2013477.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5118308_CR23","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/71.219757","volume":"4","author":"V.N. Rao","year":"1993","unstructured":"V.N. Rao and V. Kumar, On the efficiency of parallel backtracking, IEEE Transactions on Parallel and Distributed Systems 4 (1993) 427\u2013437.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"5118308_CR24","unstructured":"S.J. Russell, Efficient memory-bounded search methods, in: Proc. of ECAI-92 (1992)."},{"key":"5118308_CR25","unstructured":"A. Sen and A. Bagchi, Fast recursive formulations for best-first search that allow controlled use of memory, in: Proc. of IJCAI-89, Detroit, MI (1989) pp. 297\u2013302."},{"key":"5118308_CR26","unstructured":"P. Shell, J.A.H. Rubio and G.Q. Barro, Improving search through diversity, in: Proc. of AAAI-94, Seattle, WA (1994) pp. 1323\u20131328."},{"key":"5118308_CR27","unstructured":"T. Walsh, Depth-bounded discrepancy search, in: Proc. of IJCAI-97 (1997) pp. 1388\u20131393."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024452529781.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1024452529781\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024452529781.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:32:57Z","timestamp":1747546377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1024452529781"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5118308"],"URL":"https:\/\/doi.org\/10.1023\/a:1024452529781","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}