{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:17:10Z","timestamp":1725603430278},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_33","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"429-437","source":"Crossref","is-referenced-by-count":1,"title":["On the Relative Efficiency of DPLL and OBDDs with Axiom and Join"],"prefix":"10.1007","author":[{"given":"Matti","family":"J\u00e4rvisalo","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"33_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(02)00403-1","volume":"130","author":"J.F. Groote","year":"2003","unstructured":"Groote, J.F., Zantema, H.: Resolution and binary decision diagrams cannot simulate each other polynomially. Discrete Applied Mathematics\u00a0130(2), 157\u2013171 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-30201-8_9","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"A. Atserias","year":"2004","unstructured":"Atserias, A., Kolaitis, P.G., Vardi, M.Y.: Constraint propagation as a proof system. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 77\u201391. Springer, Heidelberg (2004)"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/11753728_60","volume-title":"Computer Science \u2013 Theory and Applications","author":"C. Sinz","year":"2006","unstructured":"Sinz, C., Biere, A.: Extended resolution proofs for conjoining BDDs. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 600\u2013611. Springer, Heidelberg (2006)"},{"key":"33_CR4","first-page":"100","volume-title":"Proc. CCC","author":"N. Segerlind","year":"2008","unstructured":"Segerlind, N.: On the relative efficiency of resolution-like proofs and ordered binary decision diagram proofs. In: Proc. CCC, pp. 100\u2013111. IEEE Computer Society, Los Alamitos (2008)"},{"issue":"6","key":"33_CR5","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1016\/j.dam.2006.11.012","volume":"156","author":"N. Peltier","year":"2008","unstructured":"Peltier, N.: Extended resolution simulates binary decision diagrams. Discrete Applied Mathematics\u00a0156(6), 825\u2013837 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"33_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.3233\/SAT190074","volume":"7","author":"O. Tveretina","year":"2010","unstructured":"Tveretina, O., Sinz, C., Zantema, H.: Ordered binary decision diagrams, pigeonhole formulas and beyond. Journal on Satisfiability, Boolean Modeling and Computation\u00a07, 35\u201358 (2010)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"issue":"10","key":"33_CR7","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.ipl.2009.01.006","volume":"109","author":"W. Chen","year":"2009","unstructured":"Chen, W., Zhang, W.: A direct construction of polynomial-size OBDD proof of pigeon hole problem. Information Processing Letters\u00a0109(10), 472\u2013477 (2009)","journal-title":"Information Processing Letters"},{"issue":"2","key":"33_CR8","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.artint.2010.10.002","volume":"175","author":"K. Pipatsrisawat","year":"2011","unstructured":"Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning SAT solvers as resolution engines. Artificial Intelligence\u00a0175(2), 512\u2013525 (2011)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"33_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07(3), 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"issue":"7","key":"33_CR10","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Slisenko, A.O. (ed.) Studies in Constructive Mathematics and Mathematical Logic, Part II. Seminars in Mathematics, V.A.Steklov Mathematical Institute, Leningrad, vol.\u00a08, pp. 115\u2013125. Consultants Bureau (1969) (originally in Russian)","DOI":"10.1007\/978-1-4899-5327-8_25"},{"issue":"2","key":"33_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/375827.375835","volume":"48","author":"E. Ben-Sasson","year":"2001","unstructured":"Ben-Sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. Journal of the ACM\u00a048(2), 149\u2013169 (2001)","journal-title":"Journal of the ACM"},{"issue":"6","key":"33_CR13","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1109\/12.144618","volume":"41","author":"H.T. Liaw","year":"1992","unstructured":"Liaw, H.T., Lin, C.S.: On the OBDD-representation of general boolean functions. IEEE Transactions on Computers\u00a041(6), 661\u2013664 (1992)","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"33_CR14","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.2178\/jsl\/1203350790","volume":"72","author":"J. Buresh-Oppenheim","year":"2007","unstructured":"Buresh-Oppenheim, J., Pitassi, T.: The complexity of resolution refinements. Journal of Symbolic Logic\u00a072(4), 1336\u20131352 (2007)","journal-title":"Journal of Symbolic Logic"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01683275","volume":"10","author":"W.J. Paul","year":"1977","unstructured":"Paul, W.J., Tarjan, R.E., Celoni, J.R.: Space bounds for a game on graphs. Mathematical Systems Theory\u00a010, 239\u2013251 (1977)","journal-title":"Mathematical Systems Theory"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/S0129626493000022","volume":"3","author":"D. Sieling","year":"1993","unstructured":"Sieling, D., Wegener, I.: NC-algorithms for operations on binary decision diagrams. Parallel Processing Letters\u00a03, 3\u201312 (1993)","journal-title":"Parallel Processing Letters"},{"issue":"1","key":"33_CR17","first-page":"137","volume":"30","author":"J. Krajicek","year":"1989","unstructured":"Krajicek, J.: Speed-up for propositional frege systems via generalizations of proofs. Commentationes Mathematicae Universitas Carolinae\u00a030(1), 137\u2013140 (1989)","journal-title":"Commentationes Mathematicae Universitas Carolinae"},{"issue":"3","key":"33_CR18","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10601-008-9062-z","volume":"14","author":"M. J\u00e4rvisalo","year":"2009","unstructured":"J\u00e4rvisalo, M., Junttila, T.: Limitations of restricted branching in clause learning. Constraints\u00a014(3), 325\u2013356 (2009)","journal-title":"Constraints"},{"issue":"2-3","key":"33_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A. Haken","year":"1985","unstructured":"Haken, A.: The intractability of resolution. Theoretical Computer Science\u00a039(2-3), 297\u2013308 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"33_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1008335.1008338","volume":"8","author":"S.A. Cook","year":"1976","unstructured":"Cook, S.A.: A short proof of the pigeon hole principle using extended resolution. SIGACT News\u00a08(4), 28\u201332 (1976)","journal-title":"SIGACT News"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T22:00:11Z","timestamp":1592863211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}