{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:07:38Z","timestamp":1762322858997,"version":"3.44.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1971,1,1]],"date-time":"1971-01-01T00:00:00Z","timestamp":31536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1971,1,1]],"date-time":"1971-01-01T00:00:00Z","timestamp":31536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006642","name":"U.S. Department of Health, Education and Welfare","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006642","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1971]]},"DOI":"10.1016\/0004-3702(71)90006-3","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:02:52Z","timestamp":1047628972000},"page":"117-128","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":61,"title":["An admissible and optimal algorithm for searching AND\/OR graphs"],"prefix":"10.1016","volume":"2","author":[{"given":"C.L.","family":"Chang","sequence":"first","affiliation":[]},{"given":"J.R.","family":"Slagle","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(71)90006-3_BIB1","series-title":"Systems and Computer Science","first-page":"125","article-title":"An Approach to Heuristic Problem Solving and Theorem Proving in the Propositional Calculus","author":"Amarel","year":"1967"},{"key":"10.1016\/0004-3702(71)90006-3_BIB2","article-title":"Generality and GPS","author":"Ernst","year":"1967","journal-title":"Doctoral dissertation at the Carnegie Institute of Technology"},{"year":"1971","series-title":"Problem Solving Methods in Artificial Intelligence","author":"Nilsson","key":"10.1016\/0004-3702(71)90006-3_BIB3"},{"key":"10.1016\/0004-3702(71)90006-3_BIB4","first-page":"H 125","author":"Nilsson","year":"1968","journal-title":"Searching Problem-Solving and Game Playing Trees for Minimal Cost Solutions"},{"key":"10.1016\/0004-3702(71)90006-3_BIB5","series-title":"Proc. International Joint Conference on Artificial Intelligence","article-title":"Concepts and Methods for Heuristic Search","author":"Sandewall","year":"1969"},{"key":"10.1016\/0004-3702(71)90006-3_BIB6","series-title":"Formal Systems and Non-Numerical Problem Solving by Computers","first-page":"246","article-title":"Heuristic Search Programs","author":"Slagle","year":"1970"},{"issue":"No. 1","key":"10.1016\/0004-3702(71)90006-3_BIB7","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":"Slage","year":"1968","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(71)90006-3_BIB8","doi-asserted-by":"crossref","DOI":"10.1016\/S0020-0255(71)80013-0","article-title":"Finding Resolution Proofs and Using Duplicate Goals in AND\/OR Trees","author":"Slagle","year":"1971","journal-title":"Information Sciences Journal"},{"key":"10.1016\/0004-3702(71)90006-3_BIB9","doi-asserted-by":"crossref","unstructured":"Baylor, G.W. and Simon, H.A. Chess Mating Combinations Program. Proceedings of the 1966 Spring Joint Computer Conference, pp. 431\u2013477.","DOI":"10.1145\/1464182.1464233"},{"issue":"1437","key":"10.1016\/0004-3702(71)90006-3_BIB10","first-page":"235","article-title":"Experiments with the Graph Tranverser Program","volume":"294","author":"Doran","year":"1966","journal-title":"Proc. Roy. Soc. A."},{"year":"1963","series-title":"Computer and Thought","key":"10.1016\/0004-3702(71)90006-3_BIB11"},{"key":"10.1016\/0004-3702(71)90006-3_BIB12","series-title":"Proc. of the International Conference on Information Processing","article-title":"Realization of a Geometry Proving Machine","author":"Gelernter","year":"1959"},{"key":"10.1016\/0004-3702(71)90006-3_BIB13","first-page":"135","article-title":"Strategy Building with the Graph Transver","volume":"1","author":"Michie","year":"1967"},{"key":"10.1016\/0004-3702(71)90006-3_BIB14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1147\/rd.33.0210","article-title":"Some Studies in Machine Learning Using the Game of Checkers","volume":"3","author":"Samuel","year":"1959","journal-title":"IBM J."},{"issue":"No. 6","key":"10.1016\/0004-3702(71)90006-3_BIB15","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1147\/rd.116.0601","article-title":"Some Studies in Machine Learning Using the Game of Checkers II. Recent Progress","volume":"11","author":"Samuel","year":"1967","journal-title":"IBM J. of Research and Development"},{"issue":"No. 3","key":"10.1016\/0004-3702(71)90006-3_BIB16","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":"Sandewell","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(71)90006-3_BIB17","unstructured":"Slagle, J.R. A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus. Reprinted in [11]."},{"key":"10.1016\/0004-3702(71)90006-3_BIB18","series-title":"Proc. of the IFIP Congress","article-title":"A Multipurpose Theorem-Proving, Heuristic Program that Learns","author":"Slagle","year":"1965"},{"issue":"No. 2","key":"10.1016\/0004-3702(71)90006-3_BIB19","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1145\/321510.321511","article-title":"Experiments with Some Programs that Search Game Trees","volume":"16","author":"Slagle","year":"1969","journal-title":"J. ACM"},{"issue":"No. 2","key":"10.1016\/0004-3702(71)90006-3_BIB20","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":"Vol. SSC-4","author":"Hart","year":"1968","journal-title":"IEEE Trans. or System Sciences and Cybernetics"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370271900063?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370271900063?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T13:10:23Z","timestamp":1756905023000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370271900063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1971]]}},"alternative-id":["0004370271900063"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(71)90006-3","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[1971]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An admissible and optimal algorithm for searching AND\/OR graphs","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0004-3702(71)90006-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1971 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}