{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:35:30Z","timestamp":1648924530720},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"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":6133,"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":[[1996,10]]},"DOI":"10.1016\/0304-3975(95)00155-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T01:06:05Z","timestamp":1027645565000},"page":"147-172","source":"Crossref","is-referenced-by-count":0,"title":["Meta-resolution: An algorithmic formalisation"],"prefix":"10.1016","volume":"166","author":[{"given":"Jean-Denis","family":"Fouks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Claude","family":"Spehner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00155-7_BIB1","series-title":"Th\u00e9orie des graphes et ses applications","author":"Berge","year":"1958"},{"key":"10.1016\/0304-3975(95)00155-7_BIB2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(90)90139-9","article-title":"Completeness of resolution revisited","volume":"74","author":"Bezem","year":"1990","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/0304-3975(95)00155-7_BIB3","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1145\/48014.48016","article-title":"Many hard examples for resolution","volume":"35","author":"Chvatal","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00155-7_BIB4","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2307\/2273702","article-title":"The relative efficiency of propositional proofs systems","volume":"44","author":"Cook","year":"1979","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(95)00155-7_BIB5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"1","author":"Davis","year":"1960","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00155-7_BIB6","article-title":"Sur la r\u00e9solution du probl\u00e8me de satisfiabilit\u00e9","author":"Fouks","year":"1991"},{"key":"10.1016\/0304-3975(95)00155-7_BIB7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(92)90356-K","article-title":"Tseitin's Formulas revisited","volume":"99","author":"Fouks","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00155-7_BIB8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(77)90054-8","article-title":"On the complexity of regular resolution and the Davis-Putnam procedure","volume":"4","author":"Galil","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00155-7_BIB9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractibility of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00155-7_BIB10","series-title":"Automatic theorem prover, A logical basis","author":"Loveland","year":"1978"},{"key":"10.1016\/0304-3975(95)00155-7_BIB11","first-page":"325","article-title":"Explicit construction of concentrators","volume":"9","author":"Margulis","year":"1973","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0304-3975(95)00155-7_BIB12","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(95)00155-7_BIB13","series-title":"Structures in Constructive Mathematics and Mathematical Logic, Part II","first-page":"115","article-title":"On the complexity of derivations in the propositional calculus","author":"Tseitin","year":"1970"},{"issue":"1","key":"10.1016\/0304-3975(95)00155-7_BIB14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/7531.8928","article-title":"Hard examples for resolution","volume":"34","author":"Urquhart","year":"1987","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001557?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001557?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:56:08Z","timestamp":1555390568000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001557"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["0304397595001557"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00155-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}