{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:51:33Z","timestamp":1648893093224},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":7198,"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":[[1993,11]]},"DOI":"10.1016\/0304-3975(93)90249-s","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"157-168","source":"Crossref","is-referenced-by-count":1,"title":["Cut formulas in propositional logic"],"prefix":"10.1016","volume":"120","author":[{"given":"Wenhui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90249-S_BIB1","first-page":"36","article-title":"The relative efficiency of propositional proof systems","volume":"44","author":"Cook","year":"1979","journal-title":"Logic"},{"key":"10.1016\/0304-3975(93)90249-S_BIB2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractability of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90249-S_BIB3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90249-S_BIB4","series-title":"Handbook of Mathematical Logic","article-title":"Proof theory: some applications of cut-elimination","author":"Schwichtenberg","year":"1977"},{"key":"10.1016\/0304-3975(93)90249-S_BIB5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0003-4843(78)90011-6","article-title":"Bounds for proof-search and speed-up in the predicate logic","volume":"15","author":"Statman","year":"1978","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/0304-3975(93)90249-S_BIB6","series-title":"Research Report No. 112","article-title":"Cut elimination and automatic proof procedures","author":"Zhang","year":"1988"},{"key":"10.1016\/0304-3975(93)90249-S_BIB7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(91)90086-H","article-title":"Cut elimination and automatic proof procedures","volume":"91","author":"Zhang","year":"1991","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390249S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390249S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:24:52Z","timestamp":1555129492000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390249S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["030439759390249S"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90249-s","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}