{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:47Z","timestamp":1725455867098},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0018401","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:31:37Z","timestamp":1132637497000},"page":"439-450","source":"Crossref","is-referenced-by-count":0,"title":["Network search with inadmissible heuristics"],"prefix":"10.1007","author":[{"given":"A.","family":"Mahanti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Ray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"38_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322358.322359","volume":"30","author":"A Bagchi","year":"1983","unstructured":"Bagchi A and Mahanti A. Search Algorithms Under Different Kinds of Heuristics \u2014 A Comparative Study, JACM 30(1), pp.1\u201321, 1983.","journal-title":"JACM"},{"issue":"1","key":"38_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2455.2458","volume":"32","author":"A Bagchi","year":"1985","unstructured":"Bagchi A and Mahanti A. Three Approaches to Heuristic Search in Networks, JACM 32(1), pp.1\u201327, 1985.","journal-title":"JACM"},{"issue":"1","key":"38_CR3","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/2455.2459","volume":"32","author":"A Mahanti","year":"1985","unstructured":"Mahanti A and Bagchi A. AND\/OR Graph Heuristic Search Methods, JACM 32(1), pp.28\u201351, 1985.","journal-title":"JACM"},{"key":"38_CR4","unstructured":"Martelli A and Montanari U. Additive AND\/OR Graphs, Proceedings of Third International Joint Conference on Artificial Intelligence, Stanford, California, pp. 1\u201311,1973."},{"key":"38_CR5","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1145\/359657.359664","volume":"12","author":"A Martelli","year":"1978","unstructured":"Martelli A and Montanari U. Optimising Decision Trees Through Heuristically Guided Search, Comm. ACM, Vol.12, pp.1025\u20131039, 1978.","journal-title":"Comm. ACM"},{"key":"38_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(84)90003-1","volume":"23","author":"L Mero","year":"1984","unstructured":"Mero L. A Heuristic Search Algorithm with Modifiable Estimate, Artificial Intelligence, Vol.23, pp.13\u201327, 1984.","journal-title":"Artificial Intelligence"},{"key":"38_CR7","volume-title":"Principles of Artificial Intelligence","author":"NJ Nilsson","year":"1980","unstructured":"Nilsson NJ. Principles of Artificial Intelligence, Tiago, Palo Alto, California, 1980."}],"container-title":["Lecture Notes in Computer Science","Knowledge Based Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018401.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:41:27Z","timestamp":1607550087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528504"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0018401","relation":{},"subject":[]}}