{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T13:00:21Z","timestamp":1725627621494},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540168089"},{"type":"electronic","value":"9783642713859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/978-3-642-71385-9_2","type":"book-chapter","created":{"date-parts":[[2011,11,2]],"date-time":"2011-11-02T10:20:41Z","timestamp":1320229241000},"page":"17-27","source":"Crossref","is-referenced-by-count":0,"title":["Decision Making in Unclear Situations"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Horacek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hermann","family":"Kaindl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","first-page":"23","volume-title":"Artificial Intelligence","author":"HJ Berliner","year":"1979","unstructured":"Berliner, H.J. (1979), \u2018The B* Tree Search Algorithm: A Best First Proof Procedure\u2019, in Artificial Intelligence 12, 23\u201340"},{"key":"2_CR2","first-page":"53","volume-title":"in Proceeding of the IJCAI-79","author":"HJ Berliner","year":"1979","unstructured":"Berliner, H.J. (1979), \u2018On the Construction of Evaluation Functions for large Domains\u2019, in Proceeding of the IJCAI-79, 53\u201355"},{"key":"2_CR3","unstructured":"Horacek H. (1984), \u2018Some conceptual defects of evaluation functions\u2019, in Proceedings of the ECAI-84, Pisa, September, 1984"},{"key":"2_CR4","first-page":"973","volume-title":"Proceedings of the EMCSR-82","author":"H Kaindl","year":"1982","unstructured":"Kaindl H. (1982), \u2018Dynamic Control of the Quiescence Search in Computer Chess\u2019, in Proceedings of the EMCSR-82, Vienna, April, 1982, 973\u2013978"},{"key":"2_CR5","first-page":"760","volume-title":"Proceedings of the IJCAI-83","author":"H Kaindl","year":"1983","unstructured":"Kaindl H. (1983), \u2018Searching to Variable Depth in Computer Chess\u2019, in Proceedings of the IJCAI-83, Karlsruhe, August, 1983, 760\u2013762"},{"key":"2_CR6","first-page":"1983","volume-title":"Searching with Probabilities, Ph.D. thesis","author":"AJ Palay","year":"1983","unstructured":"Palay A.J. (1983), \u2018Searching with Probabilities\u2019, Ph.D. thesis, Carnegie-Mellon University, May, 1983"},{"key":"2_CR7","volume-title":"Addison-Wesley Publishing Company","author":"J Pearl","year":"1984","unstructured":"Pearl J. (1984), \u2018Heuristics\u2019, Addison-Wesley Publishing Company"},{"key":"2_CR8","first-page":"1","volume-title":"Artificial Intelligence","author":"DE Wilkins","year":"1982","unstructured":"Wilkins D.E. (1982), \u2018Using Knowledge to Control Tree Searching\u2019, in Artificial Intelligence 18 (1), 1\u201351"}],"container-title":["Informatik-Fachberichte","GWAI-86 und 2. \u00d6sterreichische Artificial-Intelligence-Tagung"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-71385-9_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T23:12:11Z","timestamp":1606259531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-71385-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540168089","9783642713859"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-71385-9_2","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1986]]}}}