{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T23:31:55Z","timestamp":1710545515774},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mind Mach"],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1007\/bf00974979","type":"journal-article","created":{"date-parts":[[2005,1,9]],"date-time":"2005-01-09T02:13:30Z","timestamp":1105236810000},"page":"489-498","source":"Crossref","is-referenced-by-count":4,"title":["Heuristic evaluation functions in artificial intelligence search algorithms"],"prefix":"10.1007","volume":"5","author":[{"given":"Richard E.","family":"Korf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"CR1","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., N.J. Nilsson, and B. Raphael (1968), ?A formal basis for the heuristic determination of minimum cost paths?,IEEE Transactions on Systems Science and Cybernetics 4(2), pp. 100?107.","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"issue":"1","key":"CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.E. Korf","year":"1985","unstructured":"Korf, R.E. (1985), ?Depth-first iterative-deepening: An optimal admissible tree search?,Artificial Intelligence 27(1), pp. 97?109.","journal-title":"Artificial Intelligence"},{"key":"CR3","volume-title":"Heuristics","author":"J. Pearl","year":"1984","unstructured":"Pearl, J. (1984),Heuristics, Addison-Wesley, Reading, Ma."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0020-0255(84)90009-4","volume":"34","author":"M. Valtorta","year":"1984","unstructured":"Valtorta, M. (1984), ?A result on the computational complexity of heuristic estimates for the A* algorithm?,Information Science 34, pp. 48?59.","journal-title":"Information Science"},{"key":"CR5","first-page":"117","volume":"12","author":"A.E. Prieditis","year":"1993","unstructured":"Prieditis, A.E. (1993), ?Machine discovery of effective admissible heuristics?,Machine Learning 12, pp. 117?141.","journal-title":"Machine Learning"},{"issue":"2?3","key":"CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","volume":"42","author":"R.E. Korf","year":"1990","unstructured":"Korf, R.E. (1990), ?Real-time heuristic search?,Artificial Intelligence,42(2?3), pp. 189?211.","journal-title":"Artificial Intelligence"},{"key":"CR7","unstructured":"Christensen, J. and R.E. Korf (1986), ?A unified theory of heuristic evaluation functions and its application to learning?,Proceedings of the National Conference on Artificial Intelligence (AAAI-86), Philadelphia, Pa., pp. 148?152."},{"key":"CR8","first-page":"71","volume-title":"Computers and Thought","author":"A.L. Samuel","year":"1963","unstructured":"Samuel, A.L. (1963), ?Some studies in machine learning using the game of checkers?, inComputers and Thought, Feigenbaum and Feldman, Eds., McGraw-Hill, N.Y., pp. 71?105."},{"issue":"1?3","key":"CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Minton, S., M.D. Johnston, A.B. Philips, and P. Laird (1992), ?Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems?,Artificial Intelligence 58(1?3), pp. 161?205.","journal-title":"Artificial Intelligence"}],"container-title":["Minds and Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00974979.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00974979\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00974979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T22:37:43Z","timestamp":1556577463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00974979"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["BF00974979"],"URL":"https:\/\/doi.org\/10.1007\/bf00974979","relation":{},"ISSN":["0924-6495","1572-8641"],"issn-type":[{"value":"0924-6495","type":"print"},{"value":"1572-8641","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}