Skip to Main content Skip to Navigation
Journal articles

On Obdd-Based Algorithms and Proof Systems that Dynamically Change Order of Variables

Abstract : In 2004 Atserias, Kolaitis and Vardi proposed OBDD-based propositional proof systems that prove unsatisfiability of a CNF formula by deduction of identically false OBDD from OBDDs representing clauses of the initial formula. All OBDDs in such proofs have the same order of variables. We initiate the study of OBDD based proof systems that additionally contain a rule that allows to change the order in OBDDs. At first we consider a proof system OBDD(∧, reordering) that uses the conjunction (join) rule and the rule that allows to change the order. We exponentially separate this proof system from OBDD(∧)-proof system that uses only the conjunction rule. We prove two exponential lower bounds on the size of OBDD(∧, reordering)-refutations of Tseitin formulas and the pigeonhole principle. The first lower bound was previously unknown even for OBDD(∧)-proofs and the second one extends the result of Tveretina et al. from OBDD(∧) to OBDD(∧, reordering). In 2004 Pan and Vardi proposed an approach to the propositional satisfiability problem based on OBDDs and symbolic quantifier elimination (we denote algorithms based on this approach as OBDD(∧, ∃)-algorithms). We notice that there exists an OBDD(∧, ∃)-algorithm that solves satisfiable and unsatisfiable Tseitin formulas in polynomial time. In contrast, we show that there exist formulas representing systems of linear equations over F2 that are hard for OBDD(∧, ∃, reordering)-algorithms. Our hard instances are satisfiable formulas representing systems of linear equations over F2 that correspond to some checksum matrices of error correcting codes.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-02885744
Contributor : Andrei Romashchenko <>
Submitted on : Tuesday, July 7, 2020 - 11:13:35 AM
Last modification on : Wednesday, July 15, 2020 - 10:18:03 AM

File

LIPIcs-STACS-2017-43.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Dmitry Itsykson, Alexander Knop, Andrei Romashchenko, Dmitry Sokolov. On Obdd-Based Algorithms and Proof Systems that Dynamically Change Order of Variables. The Journal of Symbolic Logic, Association for Symbolic Logic, In press, pp.1-41. ⟨10.1017/jsl.2019.53⟩. ⟨lirmm-02885744⟩

Share

Metrics

Record views

38

Files downloads

39