{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T00:57:33Z","timestamp":1781917053902,"version":"3.54.5"},"reference-count":24,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1970,1,1]],"date-time":"1970-01-01T00:00:00Z","timestamp":0},"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":[[1970,1]]},"DOI":"10.1016\/0004-3702(70)90007-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:02:52Z","timestamp":1047628972000},"page":"193-204","source":"Crossref","is-referenced-by-count":211,"title":["Heuristic search viewed as path finding in a graph"],"prefix":"10.1016","volume":"1","author":[{"given":"Ira","family":"Pohl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(70)90007-X_BIB1","article-title":"Samplesort: A sampling approach to minimal storage tree sorting","author":"Frazer","year":"1968"},{"key":"10.1016\/0004-3702(70)90007-X_BIB2","first-page":"1840","article-title":"On the number of multiplications required to compute certain functions","volume":"58","author":"Winograd","year":"1967"},{"key":"10.1016\/0004-3702(70)90007-X_BIB3","series-title":"Problem-solving methods in artificial intelligence","author":"Nilsson","year":"1971"},{"key":"10.1016\/0004-3702(70)90007-X_BIB4","series-title":"The Search for Generality. Proceedings 1965 IFIP Congr.","first-page":"17","author":"Newell","year":"1965"},{"key":"10.1016\/0004-3702(70)90007-X_BIB5","article-title":"Heuristic search","author":"Michie","year":"1969"},{"key":"10.1016\/0004-3702(70)90007-X_BIB6","series-title":"Proc. Internat. Joint Conf. Artificial Intelligence","first-page":"199","article-title":"Concepts and methods for heuristic search","author":"Sandewall","year":"1969"},{"key":"10.1016\/0004-3702(70)90007-X_BIB7","series-title":"Computers and Thought","first-page":"279","article-title":"GPS, a program that simulates human thought","author":"Newell","year":"1963"},{"key":"10.1016\/0004-3702(70)90007-X_BIB8","first-page":"218","article-title":"Empirical explorations with the logic theory machine","volume":"11","author":"Newell","year":"1957"},{"key":"10.1016\/0004-3702(70)90007-X_BIB9","first-page":"235","article-title":"Experiments with the Graph Traverser program","volume":"294","author":"Doran","year":"1966"},{"key":"10.1016\/0004-3702(70)90007-X_BIB10","first-page":"301","article-title":"Experiments with the adaptive graph traverser","volume":"5","author":"Michie","year":"1969","journal-title":"Machine Intelligence"},{"key":"10.1016\/0004-3702(70)90007-X_BIB11","series-title":"Proc. IJCAI","first-page":"509","article-title":"A mobile automation: An application of artificial intelligence techniques","author":"Nillson","year":"1969"},{"key":"10.1016\/0004-3702(70)90007-X_BIB12","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. System Sci. Cybernetics"},{"key":"10.1016\/0004-3702(70)90007-X_BIB13","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","article-title":"Branch-and-bound methods: A survey","volume":"14","author":"Lawler","year":"1966","journal-title":"Operations Research"},{"key":"10.1016\/0004-3702(70)90007-X_BIB14","article-title":"A theory of bi-directional search in path problems","author":"Pohl","year":"1969"},{"key":"10.1016\/0004-3702(70)90007-X_BIB15","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","article-title":"An appraisal of some shortest path algorithms","volume":"17","author":"Dreyfus","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/0004-3702(70)90007-X_BIB16","series-title":"Proc. Internatl. Symp. Theory of Switching","first-page":"285","article-title":"The shortest path through a maze","author":"Moore","year":"1959"},{"key":"10.1016\/0004-3702(70)90007-X_BIB17","first-page":"181","article-title":"Search strategies for theorem-proving","volume":"5","author":"Kowalski","year":"1969","journal-title":"Machine Intelligence"},{"key":"10.1016\/0004-3702(70)90007-X_BIB18","first-page":"71","article-title":"Some studies in machine learning using the game of checkers","author":"Samuel","year":"1963","journal-title":"Computers and Thought"},{"key":"10.1016\/0004-3702(70)90007-X_BIB19","first-page":"219","article-title":"First results on the effect of error in heuristic search","volume":"5","author":"Pohl","year":"1969","journal-title":"Machine Intelligence"},{"key":"10.1016\/0004-3702(70)90007-X_BIB20","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/321526.321528","article-title":"A planning problem solver based on look-ahead in stochastic game trees","volume":"16","author":"Sandewall","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(70)90007-X_BIB21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/321439.321444","article-title":"Experiments with a multipurpose theorem-proving heuristic program","volume":"15","author":"Slagle","year":"1968","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(70)90007-X_BIB22","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1145\/321479.321487","article-title":"A formal deductive problem solving system","volume":"15","author":"Quinlan","year":"1968","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(70)90007-X_BIB23","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/321541.321542","article-title":"Sufficient conditions for the success of GPS","volume":"16","author":"Ernst","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(70)90007-X_BIB24","series-title":"Rounding Erros in Algebraic Processes","author":"Wilkinson","year":"1963"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437027090007X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437027090007X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T19:23:16Z","timestamp":1553628196000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000437027090007X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1970,1]]},"references-count":24,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1970,1]]}},"alternative-id":["000437027090007X"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(70)90007-x","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1970,1]]}}}