{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:09:56Z","timestamp":1648984196644},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":[[1992,5]]},"DOI":"10.1016\/0004-3702(92)90044-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"109-128","source":"Crossref","is-referenced-by-count":2,"title":["A semantic backward chaining proof system"],"prefix":"10.1016","volume":"55","author":[{"given":"Xumin","family":"Nie","sequence":"first","affiliation":[]},{"given":"David A.","family":"Plaisted","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(92)90044-X_BIB1","first-page":"3","article-title":"On generating and using examples in proof discovery","volume":"10","author":"Ballantyne","year":"1982"},{"key":"10.1016\/0004-3702(92)90044-X_BIB2","author":"Bibel","year":"1987"},{"key":"10.1016\/0004-3702(92)90044-X_BIB3","article-title":"Using examples to generate instantiations for set variables","author":"Bledsoe","year":"1982"},{"key":"10.1016\/0004-3702(92)90044-X_BIB4","article-title":"Locking: A restriction of resolution","author":"Boyer","year":"1970"},{"key":"10.1016\/0004-3702(92)90044-X_BIB5","author":"Gallier","year":"1986"},{"key":"10.1016\/0004-3702(92)90044-X_BIB6","series-title":"Computers and Thought","first-page":"134","article-title":"Realization of a geometry theorem-proving machine","author":"Gelernter","year":"1963"},{"key":"10.1016\/0004-3702(92)90044-X_BIB7","author":"Lloyd","year":"1987"},{"issue":"3","key":"10.1016\/0004-3702(92)90044-X_BIB8","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1145\/321526.321527","article-title":"A simplified format for the model elimination theorem-proving procedure","volume":"16","author":"Loveland","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(92)90044-X_BIB9","series-title":"Proceedings IRIA Symposium on Automatic Demonstration","first-page":"163","article-title":"Refinement theorems in resolution theory","author":"Luckham","year":"1970"},{"key":"10.1016\/0004-3702(92)90044-X_BIB10","article-title":"Otter 2.0 users' guide","author":"McCune","year":"1990"},{"issue":"3","key":"10.1016\/0004-3702(92)90044-X_BIB11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00244944","article-title":"Non-Horn clause logic programming without contrapositives","volume":"4","author":"Plaisted","year":"1988","journal-title":"J. Autom. Reasoning"},{"issue":"4","key":"10.1016\/0004-3702(92)90044-X_BIB12","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF00244355","article-title":"A sequent-style model elimination strategy and a positive refinement","volume":"6","author":"Plaisted","year":"1990","journal-title":"J. Autom. Reasoning"},{"key":"10.1016\/0004-3702(92)90044-X_BIB13","series-title":"Proceedings First Annual AI Applications Conference","first-page":"417","article-title":"Problem representations for back chaining and equality in resolution theorem proving","author":"Plaisted","year":"1984"},{"issue":"4","key":"10.1016\/0004-3702(92)90044-X_BIB14","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TC.1976.1674613","article-title":"A semantically guided deductive system for automatic theorem proving","volume":"25","author":"Reiter","year":"1976","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0004-3702(92)90044-X_BIB15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principles","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(92)90044-X_BIB16","author":"Sandford","year":"1980"},{"issue":"4","key":"10.1016\/0004-3702(92)90044-X_BIB17","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/321420.321428","article-title":"Automatic theorem proving with renamable and semantics resolution","volume":"14","author":"Slagle","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(92)90044-X_BIB18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF00246025","article-title":"Schubert's steamroller problem: formulations and solutions","volume":"2","author":"Stickel","year":"1986","journal-title":"J. Autom. Reasoning"},{"issue":"4","key":"10.1016\/0004-3702(92)90044-X_BIB19","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"},{"key":"10.1016\/0004-3702(92)90044-X_BIB20","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0004-3702(85)90029-3","article-title":"A mechanical solution of Schubert's steamroller by many-sorted resolution","volume":"26","author":"Walther","year":"1985","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(92)90044-X_BIB21","series-title":"Proceedings IJCAI-85","first-page":"1201","article-title":"Designing examples for semantically guided hierarchical deduction","author":"Wang","year":"1985"},{"issue":"1","key":"10.1016\/0004-3702(92)90044-X_BIB22","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF00381144","article-title":"Hierarchical deduction","volume":"3","author":"Wang","year":"1987","journal-title":"J. Autom. Reasoning"},{"issue":"4","key":"10.1016\/0004-3702(92)90044-X_BIB23","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/321296.321302","article-title":"Efficiency and completeness of the set of support strategy in theorem proving","volume":"12","author":"Wos","year":"1965","journal-title":"J. ACM"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029290044X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029290044X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:29:24Z","timestamp":1553646564000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000437029290044X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["000437029290044X"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(92)90044-x","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}