{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T04:42:39Z","timestamp":1777092159302,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642316111","type":"print"},{"value":"9783642316128","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31612-8_5","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T05:14:42Z","timestamp":1339996482000},"page":"44-57","source":"Crossref","is-referenced-by-count":4,"title":["An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning"],"prefix":"10.1007","author":[{"given":"Maria Luisa","family":"Bonet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sam","family":"Buss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.4086\/toc.2007.v003a005","volume":"3","author":"M. Alekhnovich","year":"2007","unstructured":"Alekhnovich, M., Johannsen, J., Pitassi, T., Urquhart, A.: An exponential separation between regular and general resolution. Theory of Computation\u00a03(4), 81\u2013102 (2007)","journal-title":"Theory of Computation"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1613\/jair.3152","volume":"40","author":"A. Atserias","year":"2011","unstructured":"Atserias, A., Fichte, J.K., Thurley, M.: Clause-learning algorithms with many restarts and and bounded-width resolution. Journal of Artificial Intelligence Research\u00a040, 353\u2013373 (2011)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1613\/jair.1410","volume":"22","author":"P. Beame","year":"2004","unstructured":"Beame, P., Kautz, H.A., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. J. Artificial Intelligence Research\u00a022, 319\u2013351 (2004)","journal-title":"J. Artificial Intelligence Research"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.apal.2005.05.002","volume":"136","author":"A. Beckmann","year":"2005","unstructured":"Beckmann, A., Buss, S.R.: Separation results for the size of constant-depth propositional proofs. Annals of Pure and Applied Logic\u00a0136, 30\u201355 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bonet, M.L., Galesi, N.: A study of proof search algorithms for resolution and polynomial calculus. In: 40th Annual IEEE Symp. on Foundations of Computer Science, pp. 422\u2013431. IEEE Computer Society (1999)","DOI":"10.1109\/SFFCS.1999.814614"},{"issue":"8","key":"5_CR6","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/s00153-009-0152-4","volume":"48","author":"S.R. Buss","year":"2009","unstructured":"Buss, S.R.: Pool resolution is NP-hard to recognise. Archive for Mathematical Logic\u00a048(8), 793\u2013798 (2009)","journal-title":"Archive for Mathematical Logic"},{"issue":"4:13","key":"5_CR7","first-page":"1","volume":"4, 4:13","author":"S.R. Buss","year":"2008","unstructured":"Buss, S.R., Hoffmann, J., Johannsen, J.: Resolution trees with lemmas: Resolution refinements that characterize DLL-algorithms with clause learning. Logical Methods of Computer Science\u00a04, 4:13(4:13), 1\u201318 (2008)","journal-title":"Logical Methods of Computer Science"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/0222044","volume":"22","author":"A. Goerdt","year":"1993","unstructured":"Goerdt, A.: Regular resolution versus unrestricted resolution. SIAM Journal on Computing\u00a022(4), 661\u2013683 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR9","unstructured":"Hertel, P., Bacchus, F., Pitassi, T., Van Gelder, A.: Clause learning can effectively p-simulate general propositional resolution. In: Proc. 23rd AAAI Conf. on Artificial Intelligence (AAAI 2008), pp. 283\u2013290. AAAI Press (2008)"},{"issue":"5","key":"5_CR10","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1137\/0216054","volume":"16","author":"W. Huang","year":"1987","unstructured":"Huang, W., Yu, X.: A DNF without regular shortest consensus path. SIAM Journal on Computing\u00a016(5), 836\u2013840 (1987)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF00265682","volume":"22","author":"B. Krishnamurthy","year":"1985","unstructured":"Krishnamurthy, B.: Short proofs for tricky formulas. Acta Informatica\u00a022(3), 253\u2013275 (1985)","journal-title":"Acta Informatica"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.artint.2010.10.002","volume":"172","author":"K. Pipatsrisawat","year":"2011","unstructured":"Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning sat solvers as resolution engines. Artificial Intelligence\u00a0172(2), 512\u2013525 (2011)","journal-title":"Artificial Intelligence"},{"issue":"5","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1137\/S0097539703428555","volume":"33","author":"N. Segerlind","year":"2004","unstructured":"Segerlind, N., Buss, S.R., Impagliazzo, R.: A switching lemma for small restrictions and lower bounds for k-DNF resolution. SIAM Journal on Computing\u00a033(5), 1171\u20131200 (2004)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s002360050044","volume":"33","author":"G. St\u00e5lmarck","year":"1996","unstructured":"St\u00e5lmarck, G.: Short resolution proofs for a sequence of tricky formulas. Acta Informatica\u00a033(3), 277\u2013280 (1996)","journal-title":"Acta Informatica"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1137\/090772897","volume":"40","author":"A. Urquhart","year":"2011","unstructured":"Urquhart, A.: A near-optimal separation of regular and general resolution. SIAM Journal on Computing\u00a040(1), 107\u2013121 (2011)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/11591191_40","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. Van Gelder","year":"2005","unstructured":"Van Gelder, A.: Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 580\u2013594. Springer, Heidelberg (2005)"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/11814948_7","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"A. Van Gelder","year":"2006","unstructured":"Van Gelder, A.: Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 48\u201353. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2014 SAT 2012"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31612-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T04:09:49Z","timestamp":1777090189000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31612-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316111","9783642316128"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31612-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}