{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:22:56Z","timestamp":1649139776075},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":7777,"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":[[1992,4]]},"DOI":"10.1016\/0304-3975(92)90393-t","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"175-181","source":"Crossref","is-referenced-by-count":0,"title":["A slight strengthening of a theorem of Blair and Kunen"],"prefix":"10.1016","volume":"97","author":[{"given":"Kees","family":"Doets","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90393-T_BIB1","series-title":"Handbook of Theoretical Computer Science Vol. B","first-page":"493","article-title":"Introduction to logic programming","author":"Apt","year":"1990"},{"key":"10.1016\/0304-3975(92)90393-T_BIB2","series-title":"Admissible Sets and Structures","author":"Barwise","year":"1975"},{"key":"10.1016\/0304-3975(92)90393-T_BIB3","article-title":"Strong termination of logic programs","author":"Bezem","year":"1990","journal-title":"Preprint, Centre for Mathematics and Computer Science"},{"key":"10.1016\/0304-3975(92)90393-T_BIB4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0019-9958(82)91234-7","article-title":"The recursion-theoretic complexity of predicate logic as a programming language","volume":"54","author":"Blair","year":"1982","journal-title":"Inform. and Control."},{"key":"10.1016\/0304-3975(92)90393-T_BIB5","author":"Blair","year":"1986","journal-title":"Decidability in the Herbrand base"},{"key":"10.1016\/0304-3975(92)90393-T_BIB6","unstructured":"K. Doets, Left-rule termination turned into termination, Theoret. Comput. Sci., to appear."},{"key":"10.1016\/0304-3975(92)90393-T_BIB7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","article-title":"Negation in logic programming","volume":"4","author":"Kunen","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(92)90393-T_BIB8","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0304-3975(92)90393-T_BIB9","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290393T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290393T?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:57:45Z","timestamp":1555127865000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290393T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["030439759290393T"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90393-t","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}