{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:26:47Z","timestamp":1648729607430},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0004-3702(89)90011-8","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:02:52Z","timestamp":1047628972000},"page":"223-235","source":"Crossref","is-referenced-by-count":0,"title":["Refinements to depth-first iterative-deepening search in automatic theorem proving"],"prefix":"10.1016","volume":"41","author":[{"given":"Xumin","family":"Nie","sequence":"first","affiliation":[]},{"given":"David A.","family":"Plaisted","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(89)90011-8_BIB1","series-title":"Tech. Rept. No. CMU-CS-88-137","article-title":"Parthenon: A parallel theorem prover for non-Horn clauses","author":"Bose","year":"1988"},{"key":"10.1016\/0004-3702(89)90011-8_BIB2","series-title":"Ph.D. Dissertation","article-title":"Input transformation and resolution implementation techniques for theorem proving in first-order logic","author":"Greenbaum","year":"1986"},{"key":"10.1016\/0004-3702(89)90011-8_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybernet."},{"key":"10.1016\/0004-3702(89)90011-8_BIB4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(80)90045-4","article-title":"Probabilistic analysis of the complexity of A\u2217","volume":"15","author":"Huyn","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90011-8_BIB5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative-deepening: An optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90011-8_BIB6","first-page":"181","article-title":"Search strategies for theorem-proving","volume":"5","author":"Kowalski","year":"1970"},{"key":"10.1016\/0004-3702(89)90011-8_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0898-1221(76)90002-X","article-title":"Complexity and related enhancements for automated theorem-proving programs","volume":"2","author":"Overbeek","year":"1976","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0004-3702(89)90011-8_BIB8","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1146\/annurev.cs.02.060187.002315","article-title":"Search techniques","volume":"2","author":"Pearl","year":"1987","journal-title":"Ann. Rev. Comput. Sci."},{"key":"10.1016\/0004-3702(89)90011-8_BIB9","series-title":"Proceedings First Annual AI Applications Conference","article-title":"Problem representations for back chaining and equality in resolution theorem proving","author":"Plaisted","year":"1984"},{"issue":"3","key":"10.1016\/0004-3702(89)90011-8_BIB10","doi-asserted-by":"crossref","DOI":"10.1007\/BF00244944","article-title":"Non-Horn clause logic programming without contrapositives","volume":"4","author":"Plaisted","year":"1988","journal-title":"J. Autom. Reasoning"},{"key":"10.1016\/0004-3702(89)90011-8_BIB11","series-title":"Proceedings IJCAI-85","first-page":"1073","article-title":"An analysis of consecutively bounded depth-first search with application automated deduction","author":"Stickel","year":"1985"},{"key":"10.1016\/0004-3702(89)90011-8_BIB12","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF00297245","article-title":"A PROLOG technology theorem prover","volume":"4","author":"Stickel","year":"1988","journal-title":"J. Autom. Reasoning"},{"issue":"1","key":"10.1016\/0004-3702(89)90011-8_BIB13","doi-asserted-by":"crossref","DOI":"10.1007\/BF00381144","article-title":"Hierarchical deduction","volume":"3","author":"Wang","year":"1987","journal-title":"J. Autom. Reasoning"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370289900118?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370289900118?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T20:22:45Z","timestamp":1553631765000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370289900118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0004370289900118"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(89)90011-8","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}