Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR17-179 | 20th November 2017 07:31

IPS-like Proof Systems Based on Binary Decision Diagrams


Authors: Alexander Knop
Publication: 26th November 2017 10:07
Downloads: 1427


It is well-known that there is equivalence between ordered resolution and ordered binary decision diagrams (OBDD) [LNNW95]; i.e., for any unsatisfiable formula ?, the size of the smallest ordered resolution refutation of ? equal to the size of the smallest OBDD for the canonical search problem corresponding to ?. But there is no such equivalence between resolution and branching programs (BP).
In this paper, we study different proof systems equivalent to classes of branching programs between BP and OBDD. These proof systems are similar to roABP-IPS, an algebraic proof system defined by Forbes et al. [FSTW16] and based on the ideal proof system introduced by Grochow and Pitassi [GP14].
In the paper, we show that proof systems equivalent to k-OBDD are not comparable with resolution and cutting planes. We also prove exponential lower bounds for these proof systems on Tseitin formulas. Additionally, we show that proof systems equivalent to (1,+k)-BP are strictly stronger than regular resolution.

ISSN 1433-8092 | Imprint