Sam Buss
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.
- Noga Alon. 1986. Eigenvalues and expanders. Combinatorica 6, 2 (June 1986), 83–96. DOI:https://doi.org/10.1007/BF02579166Google Scholar
Digital Library
- Noga Alon and Fan R. K. Chung. 2006. Explicit Construction of linear sized tolerant networks. Discrete Mathematics 306, 10–11 (2006), 1068–1071. DOI:https://doi.org/10.1016/j.disc.2006.03.025Google ScholarCross Ref
- Noga Alon and Joel H. Spencer. 2000. The Probabilistic Method, 2nd ed. Wiley Publishing.Google Scholar
- Sanjeev Arora and Boaz Barak. 2009. Computational Complexity: A Modern Approach. Cambridge University Press, New York.Google ScholarDigital Library
- 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.Google Scholar
- Eli Ben-Sasson and Ave Wigderson. 2001. Short proofs are narrow—Resolution made simple. J. ACM 48 (2001), 149–169. Issue 2.Google ScholarDigital Library
- Randal E. Bryant. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35, 8 (1986), 677–691. DOI:https://doi.org/10.1109/TC.1986.1676819Google ScholarDigital Library
- Randal E. Bryant. 1992. Symbolic Boolean manipulation with ordered binary-decision diagram. Comput. Surveys 24, 3 (1992), 293–318.Google ScholarDigital Library
- 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.Google ScholarDigital Library
- Larry Carter and Mark N. Wegman. 1979. Universal classes of hash functions. J. Comput. Syst. Sci. 18, 2 (1979), 143–154. DOI:https://doi.org/10.1016/0022-0000(79)90044-8Google ScholarCross Ref
- 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. DOI:https://doi.org/10.1016/j.ipl.2009.01.006Google ScholarDigital Library
- 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.Google Scholar
- Stephen A. Cook and Robert A. Reckhow. 1979. The relative efficiency of propositional proof systems. J. Symbol. Logic 44 (1979), 36–50.Google ScholarCross Ref
- 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. DOI:https://doi.org/10.1007/978-3-642-38536-0_11Google ScholarCross Ref
- 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. DOI:https://doi.org/10.1145/3188745.3188838Google ScholarDigital Library
- 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. DOI:https://doi.org/10.4230/LIPIcs.MFCS.2017.26Google Scholar
- Mika Göös and Toniann Pitassi. 2018. Communication lower bounds via critical block sensitivity. SIAM J. Comput. 47, 5 (2018), 1778–1906. DOI:https://doi.org/10.1137/16M1082007Google ScholarDigital Library
- 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.Google Scholar
- Armin Haken. 1985. The intractability of resolution. Theor. Comput. Sci. 39 (1985), 297–308.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- 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. DOI:https://doi.org/10.1007/978-3-642-23786-7_33Google Scholar
- Alexander Knop. 2017. IPS-like Proof Systems Based on Binary Decision Diagrams. Technical Report ECCC-TR15-053. Electronic Colloquium on Computational Complexity.Google Scholar
- 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. DOI:https://doi.org/10.2178/jsl/1208358751Google ScholarCross Ref
- Alexander Lubotzky, Ralph Phillips, and Peter Sarnak. 1988. Ramanujan graphs. Combinatorica 8, 3 (1988), 261–277.Google ScholarCross Ref
- 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.Google ScholarDigital Library
- Guoqiang Pan and Moshe Y. Vardi. 2005. Symbolic techniques in satisfiability solving. J. Autom. Reason. 35, 1–3 (2005), 25–50. DOI:https://doi.org/10.1007/s10817-005-9009-7Google Scholar
- Pavel Pudlák. 1997. Lower Bounds for resolution and cutting planes proofs and monotone computations. J. Symbol. Logic 62, 3 (1997), 981–998.Google ScholarCross Ref
- 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. DOI:https://doi.org/10.4230/LIPIcs.CCC.2015.88Google ScholarDigital Library
- 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.Google Scholar
- 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. DOI:https://doi.org/10.1109/CCC.2008.34Google ScholarDigital Library
- Alexander A. Sherstov. 2014. Communication lower bounds using directional derivatives. J. ACM 61, 6 (2014), 34:1–34:71. DOI:https://doi.org/10.1145/2629334Google ScholarDigital Library
- Jorg Siekmann and Graham Wrightson. 1983. Automation of Reasoning. Vols. 1&2. Springer-Verlag, Berlin.Google Scholar
- 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.Google Scholar
- William T. Tutte. 1947. The factorization of linear graphs. J. London Math. Soc. s1-22, 2 (1947), 107–111. DOI:https://doi.org/10.1112/jlms/s1-22.2.107Google Scholar
- 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.Google ScholarCross Ref
- Alasdair Urquhart. 1987. Hard examples for resolution. J. Assoc. Comput. Mach. 34 (1987), 209–219.Google ScholarDigital Library
- Ingo Wegener. 1987. Branching Programs and Binary Decision Diagrams: Theory and Applications. SIAM.Google Scholar
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: From Circuits to QBF Proof Systems
ITCS '16: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer ScienceA general and long-standing belief in the proof complexity community asserts that there is a close connection between progress in lower bounds for Boolean circuits and progress in proof size lower bounds for strong propositional proof systems. Although ...
Comments