{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T18:35:54Z","timestamp":1694630154836},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[1976,8,1]],"date-time":"1976-08-01T00:00:00Z","timestamp":207705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1976,8]]},"DOI":"10.1109\/tc.1976.1674695","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"769-772","source":"Crossref","is-referenced-by-count":0,"title":["Introduction Tutorial on Resolution"],"prefix":"10.1109","volume":"C-25","author":[{"family":"Henschen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"807","author":"fishman","year":"0","journal-title":"A problem oriented search procedure for theorem proving"},{"key":"ref3","first-page":"844","author":"ernst","year":"0","journal-title":"The limited use of higher order logic in program verification"},{"key":"ref10","first-page":"823","author":"sickle","year":"0","journal-title":"A search technique for clause interconnectivity graphs"},{"key":"ref6","first-page":"773","author":"mccharen","year":"0","journal-title":"Problems and experiments for and with automated theorem-proving programs"},{"key":"ref11","first-page":"835","author":"winker","year":"0","journal-title":"An evaluation of an implementation of qualified hyperresolution"},{"key":"ref5","first-page":"816","author":"henschen","year":"0","journal-title":"Semantic resolution for Horn sets"},{"key":"ref8","first-page":"852","author":"morgan","year":"0","journal-title":"Methods for automated theorem proving in nonclassical logics"},{"key":"ref7","first-page":"782","author":"wilson","year":"0","journal-title":"Resolution refinements and search strategies?A comparative study"},{"key":"ref2","author":"chang","year":"1973","journal-title":"Symbolic Logic and Mechanical Theorem Proving"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/321250.321253"},{"key":"ref1","first-page":"801","author":"andrews","year":"0","journal-title":"Refutations by mating"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35150\/01674695.pdf?arnumber=1674695","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:39:26Z","timestamp":1638200366000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1674695\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,8]]},"references-count":11,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tc.1976.1674695","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1976,8]]}}}