{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T15:46:21Z","timestamp":1693151181455},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11155,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1983]]},"DOI":"10.1016\/0304-3975(83)90022-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"239-261","source":"Crossref","is-referenced-by-count":13,"title":["A complete, nonredundant algorithm for reversed Skolemization"],"prefix":"10.1016","volume":"28","author":[{"given":"P.T.","family":"Cox","sequence":"first","affiliation":[]},{"given":"T.","family":"Pietrzykowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90022-1_BIB1","series-title":"Res. Rept. CS-76-13","article-title":"A practically linear unification algorithm","author":"Baxter","year":"1976"},{"key":"10.1016\/0304-3975(83)90022-1_BIB2","series-title":"Memo ATP-41","article-title":"Unskolemizing","author":"Bledsoe","year":"1978"},{"key":"10.1016\/0304-3975(83)90022-1_BIB3","first-page":"374","article-title":"A complete non-redundant algorithm for reversed Skolemization","volume":"87","author":"Cox","year":"1980"},{"key":"10.1016\/0304-3975(83)90022-1_BIB4","series-title":"Res. Rept. CS-78-33","article-title":"Mechanical hypothesis formation","author":"Pietrzykowski","year":"1978"},{"key":"10.1016\/0304-3975(83)90022-1_BIB5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(71)90003-8","article-title":"Extracting information from resolution proof trees","volume":"2","author":"Luckham","year":"1971","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(83)90022-1_BIB6","series-title":"Computer-Based Medical Consulation: MYCIN","author":"Shortliffe","year":"1976"},{"key":"10.1016\/0304-3975(83)90022-1_BIB7","first-page":"125","article-title":"\u00dcber die Mathematische Logik","volume":"10","author":"Skolem","year":"1928","journal-title":"Norsk Matematisk Tidsskrift"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900221?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900221?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:50:25Z","timestamp":1555127425000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583900221"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90022-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}