{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T08:42:37Z","timestamp":1753519357755},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0004-3702(89)90010-6","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:02:52Z","timestamp":1047628972000},"page":"197-221","source":"Crossref","is-referenced-by-count":67,"title":["Heuristic search in restricted memory"],"prefix":"10.1016","volume":"41","author":[{"given":"P.P.","family":"Chakrabarti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Ghose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Acharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.C.","family":"de Sarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(89)90010-6_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2455.2458","article-title":"Three approaches to heuristic search in networks","volume":"32","author":"Bagchi","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(89)90010-6_BIB2","series-title":"Proceedings AAAI-86","first-page":"163","article-title":"Making the best use of available memory when searching game trees","author":"Bhattacharyya","year":"1986"},{"key":"10.1016\/0004-3702(89)90010-6_BIB3","series-title":"Ph.D. Thesis","article-title":"Some studies in heuristic search theory and algorithms","author":"Chakrabarti","year":"1988"},{"key":"10.1016\/0004-3702(89)90010-6_BIB4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(87)90005-1","article-title":"Admissibility of AO\u2217 when heuristics overestimate","volume":"34","author":"Chakrabarti","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90010-6_BIB5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00991818","article-title":"Depth_m search in branch and bound algorithms","volume":"7","author":"Ibaraki","year":"1978","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"10.1016\/0004-3702(89)90010-6_BIB6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative-deepening: An optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90010-6_BIB7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0004-3702(87)90019-1","article-title":"Low overhead alternatives to SSS\u2217","volume":"31","author":"Marsland","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90010-6_BIB8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(84)90004-3","article-title":"General branch and bound, and its relation to A\u2217 and AO\u2217","volume":"23","author":"Nau","year":"1984","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90010-6_BIB9","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/0004-3702(89)90010-6_BIB10","series-title":"Heuristics","author":"Pearl","year":"1984"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370289900106?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370289900106?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T20:22:46Z","timestamp":1553631766000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370289900106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0004370289900106"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(89)90010-6","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}