{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:16Z","timestamp":1725456196406},"publisher-location":"Berlin\/Heidelberg","reference-count":1,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019343X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0012873","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:12:39Z","timestamp":1132726359000},"page":"737-737","source":"Crossref","is-referenced-by-count":0,"title":["A goal directed theorem prover"],"prefix":"10.1007","author":[{"given":"David A.","family":"Plaisted","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"54_CR1","doi-asserted-by":"crossref","unstructured":"Plaisted, D., \u201cNon-Horn clause logic programming without contrapositives,\u201d 1987, Journal of Automated Reasoning, to appear.","DOI":"10.1007\/BF00244944"}],"container-title":["Lecture Notes in Computer Science","9th International Conference on Automated Deduction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0012873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:23:29Z","timestamp":1586579009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019343X"],"references-count":1,"URL":"https:\/\/doi.org\/10.1007\/bfb0012873","relation":{},"subject":[]}}