{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:11:26Z","timestamp":1720051886465},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"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":5038,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,10]]},"DOI":"10.1016\/s0166-218x(99)00055-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:12:16Z","timestamp":1027584736000},"page":"139-148","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Resolution remains hard under equivalence"],"prefix":"10.1016","volume":"96-97","author":[{"given":"Hans Kleine","family":"B\u00fcning","sequence":"first","affiliation":[]},{"given":"Theodor","family":"Lettmann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00055-4_BIB1","unstructured":"C.L. Chang, R.C. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973."},{"key":"10.1016\/S0166-218X(99)00055-4_BIB2","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1008335.1008338","article-title":"A short proof of the Pigeon Hole principle using extended resolution","volume":"8","author":"Cook","year":"1976","journal-title":"SIGACT News"},{"key":"10.1016\/S0166-218X(99)00055-4_BIB3","doi-asserted-by":"crossref","unstructured":"S.A. Cook, R.A. Reckhow, On the lengths of proofs in the propositional calculus, Proceedings of the Sixth Annual Symposium on Theory of Computing, 1974, pp. 135\u2013148.","DOI":"10.1145\/800119.803893"},{"key":"10.1016\/S0166-218X(99)00055-4_BIB4","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/321796.321807","article-title":"An implementation of the model elimination proof procedure","volume":"21","author":"Fleisig","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(99)00055-4_BIB5","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\/S0166-218X(99)00055-4_BIB6","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0890-5401(89)90021-7","article-title":"Optimizing propositional calculus formulas with regard to questions of deducibility","volume":"80","author":"Kleine B\u00fcning","year":"1989","journal-title":"Inform. Comput."},{"key":"10.1016\/S0166-218X(99)00055-4_BIB7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00881947","article-title":"Controlled integration of the cut rule into connection Tableau calculi","volume":"13","author":"Letz","year":"1994","journal-title":"J. Automat. Reason."},{"key":"10.1016\/S0166-218X(99)00055-4_BIB8","doi-asserted-by":"crossref","unstructured":"D.A. Plaisted, Y. Zhu, The Efficiency of Theorem Proving Strategies, Vieweg, Braunschweig, 1997.","DOI":"10.1007\/978-3-322-93862-6"},{"key":"10.1016\/S0166-218X(99)00055-4_BIB9","doi-asserted-by":"crossref","unstructured":"G.S. Tseitin, On the complexity of derivation in propositional calculus, in: A.O. Silenko (Ed.), Studies in Constructive Mathematics and Mathematical Logic, Part II, 1970, pp. 115\u2013125.","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"10.1016\/S0166-218X(99)00055-4_BIB10","doi-asserted-by":"crossref","first-page":"425","DOI":"10.2178\/bsl\/1203350879","article-title":"The complexity of propositional proofs","volume":"1","author":"Urquhart","year":"1995","journal-title":"Bull. Symbolic Logic"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000554?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000554?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T19:28:12Z","timestamp":1556652492000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99000554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":10,"alternative-id":["S0166218X99000554"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00055-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}