{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T06:53:07Z","timestamp":1673419987363},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"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":12616,"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":[[1979]]},"DOI":"10.1016\/0304-3975(79)90054-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"31-44","source":"Crossref","is-referenced-by-count":22,"title":["Tautology testing with a generalized matrix reduction method"],"prefix":"10.1016","volume":"8","author":[{"given":"W.","family":"Bibel","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90054-9_BIB1","series-title":"Theoretical Comp. Science 3rd GI Conf.","first-page":"215","article-title":"A syntactic connection between proof procedures and refutation procedures","volume":"48","author":"Bibel","year":"1977"},{"key":"10.1016\/0304-3975(79)90054-9_BIB2","series-title":"Proc. Int. Computing Symposium","first-page":"205","article-title":"Proof search in a Gentzen-like system of first-order logic","author":"Bibel","year":"1975"},{"key":"10.1016\/0304-3975(79)90054-9_BIB3","article-title":"Non-resolution theorem proving","volume":"ATP 29","author":"Bledsoe","year":"1975"},{"key":"10.1016\/0304-3975(79)90054-9_BIB4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(72)90041-0","article-title":"Computer proofs of limit theorems","volume":"3","author":"Bledsoe","year":"1972","journal-title":"Artif. Intelligence"},{"key":"10.1016\/0304-3975(79)90054-9_BIB5","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971","journal-title":"Proc. 3rd Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(79)90054-9_BIB6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0003-4843(76)90020-6","article-title":"Toward feasible solutions of the tautology problem","volume":"10","author":"Dunham","year":"1976","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/0304-3975(79)90054-9_BIB7","article-title":"Super-exponential complexity of Presburger arithmetic","volume":"43","author":"Fischer","year":"1974"},{"key":"10.1016\/0304-3975(79)90054-9_BIB8","series-title":"TR 75-239","article-title":"The complexity of resolution procedures for theorem proving in the propositional calculus","author":"Galil","year":"1975"},{"key":"10.1016\/0304-3975(79)90054-9_BIB9","series-title":"Theorem proving by covering expressions","author":"Henschen","year":"1976"},{"key":"10.1016\/0304-3975(79)90054-9_BIB10","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(79)90054-9_BIB11","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1145\/321850.321858","article-title":"A human-oriented logic for automatic theorem proving","author":"Nevins","year":"1974","journal-title":"J. Assoc. Comput. Mech."},{"key":"10.1016\/0304-3975(79)90054-9_BIB12","first-page":"207","article-title":"A Proof Procedure with Matrix Reduction","volume":"125","author":"Prawitz","year":"1970"},{"key":"10.1016\/0304-3975(79)90054-9_BIB13","series-title":"Techn. Report No. 87","article-title":"On the lengths of proofs in the propositional calculus","author":"Reckhow","year":"1976"},{"key":"10.1016\/0304-3975(79)90054-9_BIB14","series-title":"Rapport de Recherche No. 101","article-title":"A structure sharing technique for matrices and substitutions in Prawitz's theorem proving method","author":"Saya","year":"1977"},{"key":"10.1016\/0304-3975(79)90054-9_BIB15","first-page":"115","article-title":"On the complexity of derivations in the propositional calculus","author":"Tseitin","year":"1968","journal-title":"Studies in Constructive Mathematics and Mathematical Logic II"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900549?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900549?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:23:12Z","timestamp":1555111392000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900549"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979]]}},"alternative-id":["0304397579900549"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90054-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}
