Lower Bounds on OBDD Proofs with Several Orders
Authors: 
Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry SokolovAuthors Info & Claims
Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry SokolovAuthors Info & ClaimsArticle No.: 26, Pages 1 - 30
Abstract
This article is motivated by seeking lower bounds on OBDD(∧, w, r) refutations, namely, OBDD refutations that allow weakening and arbitrary reorderings. We first work with 1 - NBP ∧ refutations based on read-once nondeterministic branching programs. These generalize OBDD(∧, r) refutations. There are polynomial size 1 - NBP(∧) refutations of the pigeonhole principle, hence 1-NBP(∧) is strictly stronger than OBDD}(∧, r). There are also formulas that have polynomial size tree-like resolution refutations but require exponential size 1-NBP(∧) refutations. As a corollary, OBDD}(∧, r) does not simulate tree-like resolution, answering a previously open question.
The system 1-NBP(∧, ∃) uses projection inferences instead of weakening. 1-NBP(∧, ∃k is the system restricted to projection on at most k distinct variables. We construct explicit constant degree graphs Gn on n vertices and an ε > 0, such that 1-NBP(∧, ∃ε n) refutations of the Tseitin formula for Gn require exponential size.
Second, we study the proof system OBDD}(∧, w, rℓ), which allows ℓ different variable orders in a refutation. We prove an exponential lower bound on the complexity of tree-like OBDD(∧, w, rℓ) refutations for ℓ = ε log n, where n is the number of variables and ε > 0 is a constant. The lower bound is based on multiparty communication complexity.
References
[1]
Noga Alon. 1986. Eigenvalues and expanders. Combinatorica 6, 2 (June 1986), 83–96.
[2]
Noga Alon and Fan R. K. Chung. 2006. Explicit Construction of linear sized tolerant networks. Discrete Mathematics 306, 10–11 (2006), 1068–1071.
[3]
Noga Alon and Joel H. Spencer. 2000. The Probabilistic Method, 2nd ed. Wiley Publishing.
[4]
Sanjeev Arora and Boaz Barak. 2009. Computational Complexity: A Modern Approach. Cambridge University Press, New York.
[5]
Albert Atserias, Phokion G. Kolaitis, and Moshe Y. Vardi. 2004. Constraint propogation as a proof system. In Proceedings of the 10th International Conf. on Principles and Practice of Constraint Programming (Lecture Notes in Computer Science 3258). Springer Verlag, 77–91.
[6]
Eli Ben-Sasson and Ave Wigderson. 2001. Short proofs are narrow—Resolution made simple. J. ACM 48 (2001), 149–169. Issue 2.
[7]
Randal E. Bryant. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35, 8 (1986), 677–691.
[8]
Randal E. Bryant. 1992. Symbolic Boolean manipulation with ordered binary-decision diagram. Comput. Surveys 24, 3 (1992), 293–318.
[9]
Sam Buss, Dmitry Itsykson, Alexander Knop, and Dmitry Sokolov. 2018. Reordering rule makes OBDD proof systems stronger. In Proceedings of the 33rd Computational Complexity Conference (CCC’18) (LIPIcs 102). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16:1–24.
[10]
Larry Carter and Mark N. Wegman. 1979. Universal classes of hash functions. J. Comput. Syst. Sci. 18, 2 (1979), 143–154.
[11]
Wěi Chén and Wenhui Zhang. 2009. A direct construction of polynomial-size OBDD proof of pigeon hole problem. Inform. Process. Lett. 109, 10 (2009), 472–477.
[12]
Stephen A. Cook and Robert A. Reckhow. 1974. On the lengths of proofs in the propositional calculus, preliminary version. In Proceedings of the 6th Annual ACM Symposium on the Theory of Computing. 135–148.
[13]
Stephen A. Cook and Robert A. Reckhow. 1979. The relative efficiency of propositional proof systems. J. Symbol. Logic 44 (1979), 36–50.
[14]
Luke Friedman and Yixin Xu. 2013. Exponential lower bounds for refuting random formulas using ordered binary decision diagrams. In Proceedings of the 8th Computer Science Symposium in Russia: Computer Science—Theory and Applications (CSR’13) (Lecture Notes in Computer Science 7913). Springer, 127–138.
[15]
Ankit Garg, Mika Göös, Pritish Kamath, and Dmitry Sokolov. 2018. Monotone circuit lower bounds from resolution. In Proceedings of the 50th ACM Symposium on Theory of Computing (STOC’18). 902–911.
[16]
Ludmila Glinskih and Dmitry Itsykson. 2017. Satisfiable Tseitin formulas are hard for nondeterministic read-once branching programs. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS’17). 26:1–26:12.
[17]
Mika Göös and Toniann Pitassi. 2018. Communication lower bounds via critical block sensitivity. SIAM J. Comput. 47, 5 (2018), 1778–1906.
[18]
Dima Grigoriev, Edward A. Hirsch, and Dmitrii V. Pasechnik. 2002. Complexity of semi-algebraic proofs. In Proceedings of the 19th Symposium on Theoretical Aspects of Computer Science (STACS’02) (Lecture Notes in Computer Science 2285). Springer Verlag, 419–430.
[19]
Armin Haken. 1985. The intractability of resolution. Theor. Comput. Sci. 39 (1985), 297–308.
[20]
Dmitry Itsykson, Alexander Knop, Andrei Romashchenko, and Dmitry Sokolov. 2017. On ODBB-based algorithms and proof systems that dynamically change order of variables. J. Symbol. Logic 85, 2 (2020), 632–670.
[21]
Matti Järvisalo. 2011. On the relative efficiency of DPLL and OBDDs with Axiom and Join. In Proceedings of the Principles and Practice of Constraint Programming (CP’11) (Lecture Notes in Computer Science 6876). Springer Verlag, 429–437.
[22]
Alexander Knop. 2017. IPS-like Proof Systems Based on Binary Decision Diagrams. Technical Report ECCC-TR15-053. Electronic Colloquium on Computational Complexity.
[23]
Jan Krajíček. 2008. An exponential lower bound for a constraint propogation proof system based on ordered binary decision diagrams. J. Symbol. Logic 73, 1 (2008), 227–237.
[24]
Alexander Lubotzky, Ralph Phillips, and Peter Sarnak. 1988. Ramanujan graphs. Combinatorica 8, 3 (1988), 261–277.
[25]
Christoph Meinel and Thorsten Theobald. 1998. Algorithms and Data Structures in VLSI Design: OBDD—Foundations and Applications. Springer. 267+ix pages. Translation of the 1998 German edition.
[26]
Guoqiang Pan and Moshe Y. Vardi. 2005. Symbolic techniques in satisfiability solving. J. Autom. Reason. 35, 1–3 (2005), 25–50.
[27]
Pavel Pudlák. 1997. Lower Bounds for resolution and cutting planes proofs and monotone computations. J. Symbol. Logic 62, 3 (1997), 981–998.
[28]
Anup Rao and Amir Yehudayoff. 2015. Simplified lower bounds on the multiparty communication complexity of disjointness. In Proceedings of the 30th Conference on Computational Complexity (CCC’15) (LIPIcs 33). 88–101.
[29]
Nathan Segerlind. 2007. Nearly-Exponential Size Lower Bounds for Symbolic Quantifier Elimination Algorithms and OBDD-Based Proofs of Unsatisfiability. Technical Report TR07-009. Electronic Colloquium on Computational Complexity (ECCC). Retrieved from eccc.hpi-web.de/eccc-reports/2007/TR07-009.
[30]
Nathan Segerlind. 2008. On the relative efficiency of resolution-like proofs and ordered binary decision diagram proofs. In Proceedings of the 23rd Annual IEEE Conference on Computational Complexity (CCC’08). 100–111.
[31]
Alexander A. Sherstov. 2014. Communication lower bounds using directional derivatives. J. ACM 61, 6 (2014), 34:1–34:71.
[32]
Jorg Siekmann and Graham Wrightson. 1983. Automation of Reasoning. Vols. 1&2. Springer-Verlag, Berlin.
[33]
G. S. Tsejtin. 1968. On the complexity of derivation in propositional logic. Studies in Constructive Mathematics and Mathematical Logic 2 (1968), 115–125. Reprinted in Reference [32, vol. 2], pp. 466-483.
[34]
William T. Tutte. 1947. The factorization of linear graphs. J. London Math. Soc. s1-22, 2 (1947), 107–111.
[35]
Olga Tvertina, Carsten Sinz, and Hans Zantema. 2010. Ordered binary decision diagrams, pigeonhole principles and beyond. J. Satisfiabil. Boolean Model. Comput. 7, 1 (2010), 35–58.
[36]
Alasdair Urquhart. 1987. Hard examples for resolution. J. Assoc. Comput. Mach. 34 (1987), 209–219.
[37]
Ingo Wegener. 1987. Branching Programs and Binary Decision Diagrams: Theory and Applications. SIAM.
Index Terms
- Lower Bounds on OBDD Proofs with Several Orders
Recommendations
Reordering rule makes OBDD proof systems stronger
CCC '18: Proceedings of the 33rd Computational Complexity ConferenceAtserias, Kolaitis, and Vardi showed that the proof system of Ordered Binary Decision Diagrams with conjunction and weakening, OBDD(∧, weakening), simulates CP* (Cutting Planes with unary coefficients). We show that OBDD(∧, weakening) can give ...
Resolution with Counting: Dag-Like Lower Bounds and Different Moduli
AbstractResolution over linear equations is a natural extension of the popular resolution refutation system, augmented with the ability to carry out basic counting. Denoted , this refutation system operates with disjunctions of linear equations with ...
Lower Bounds for Regular Resolution over Parities
STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingThe proof system resolution over parities (Res(⊕)) operates with disjunctions of linear equations (linear clauses) over GF(2); it extends the resolution proof system by incorporating linear algebra over GF(2). Over the years, several exponential lower ...
Comments
Information & Contributors
Information
Published In
October 2021
264 pages
Copyright © 2021 Copyright held by the owner/author(s). Publication rights licensed to ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 September 2021
Accepted: 01 May 2021
Revised: 01 May 2021
Received: 01 May 2020
Published in TOCL Volume 22, Issue 4
Check for updates
Author Tags
Qualifiers
- Research-article
- Refereed
Funding Sources
- Russian Science Foundation
- Simons Foundation
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 62Total Downloads
- Downloads (Last 12 months)14
- Downloads (Last 6 weeks)2
Reflects downloads up to 25 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format