{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:09:31Z","timestamp":1648843771147},"reference-count":6,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":6324,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1016\/0004-3702(94)00085-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:24:09Z","timestamp":1027643049000},"page":"237-257","source":"Crossref","is-referenced-by-count":3,"title":["Searching game trees under a partial order"],"prefix":"10.1016","volume":"82","author":[{"given":"Pallab","family":"Dasgupta","sequence":"first","affiliation":[]},{"given":"P.P.","family":"Chakrabarti","sequence":"additional","affiliation":[]},{"given":"S.C.","family":"DeSarkar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(94)00085-9_BIB1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","article-title":"An analysis of alpha-beta pruning","volume":"6","author":"Knuth","year":"1975","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00085-9_BIB2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(91)90082-U","article-title":"Multi-player alpha-beta pruning","volume":"48","author":"Korf","year":"1991","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00085-9_BIB3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","article-title":"Shortest paths without a map","volume":"84","author":"Papadimitriou","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0004-3702(94)00085-9_BIB4","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(94)00085-9_BIB5","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1145\/115234.115368","article-title":"Multiobjective A\u2217","volume":"38","author":"Stewart","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(94)00085-9_BIB6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0004-3702(79)90016-X","article-title":"A minimax algorithm better than alpha-beta?","volume":"12","author":"Stockman","year":"1979","journal-title":"Artif. Intell."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294000859?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294000859?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T06:27:40Z","timestamp":1555050460000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370294000859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0004370294000859"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(94)00085-9","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}