{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T20:28:09Z","timestamp":1771014489311,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":[[1983,1]]},"DOI":"10.1016\/0004-3702(83)90013-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"1-13","source":"Crossref","is-referenced-by-count":37,"title":["Knowledge versus search"],"prefix":"10.1016","volume":"20","author":[{"given":"Judea","family":"Pearl","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0004-3702(83)90013-9_BIB1","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. Systems Sci. Cybernet."},{"key":"10.1016\/0004-3702(83)90013-9_BIB2","series-title":"Problem-Solving Methods in Artificial Intelligence","author":"Nilsson","year":"1971"},{"key":"10.1016\/0004-3702(83)90013-9_BIB3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0004-3702(71)90006-3","article-title":"An admissible and optimal algorithm for searching AND\/OR graphs","volume":"2","author":"Chang","year":"1971","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/0004-3702(83)90013-9_BIB4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0004-3702(74)90014-9","article-title":"Heuristic search under conditions of error","volume":"5","author":"Harris","year":"1974","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/0004-3702(83)90013-9_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(77)90002-9","article-title":"On the complexity of admissible search algorithms","volume":"8","author":"Martelli","year":"1977","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/0004-3702(83)90013-9_BIB6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0004-3702(77)90005-4","article-title":"On the optimality of A\u2217","volume":"8","author":"Gelperin","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(83)90013-9_BIB7","article-title":"Practical and theoretical considerations in heuristic search algorithms","volume":"8","author":"Pohl","year":"1977"},{"key":"10.1016\/0004-3702(83)90013-9_BIB8","series-title":"Ph.D. Dissertation","article-title":"Performance measurement and analysis of certain search algorithms","author":"Gaschnig","year":"1979"},{"key":"10.1016\/0004-3702(83)90013-9_BIB9","article-title":"First results on the effect of error in heuristic search","volume":"5","author":"Pohl","year":"1970"},{"key":"10.1016\/0004-3702(83)90013-9_BIB10","series-title":"Tech. Rept. HP-76-2","article-title":"Some results on the complexity of heuristic search in graphs","author":"Munyer","year":"1976"},{"issue":"4","key":"10.1016\/0004-3702(83)90013-9_BIB11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0020-0255(76)90009-8","article-title":"Problem representations and formal properties of heuristic search","volume":"11","author":"Vanderbrug","year":"1976","journal-title":"Informat. Sci."},{"issue":"3","key":"10.1016\/0004-3702(83)90013-9_BIB12","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(80)90045-4","article-title":"Probabilistic analysis of the complexity of A\u2217","volume":"15","author":"Huyn","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(83)90013-9_BIB13","article-title":"The utility of precision in search heuristics","author":"Pearl","year":"1980","journal-title":"UCLA-ENG-CSL-8065"},{"key":"10.1016\/0004-3702(83)90013-9_BIB14","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"issue":"4","key":"10.1016\/0004-3702(83)90013-9_BIB15","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00991818","article-title":"m-depth search in branch-and-bound algorithms","volume":"7","author":"Ibaraki","year":"1978","journal-title":"Internat. J. Comput. Informat. Sci."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370283900139?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370283900139?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T23:50:32Z","timestamp":1553644232000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370283900139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["0004370283900139"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(83)90013-9","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}