Skip to main navigation Skip to search Skip to main content

Reordering rule makes OBDD proof systems stronger

  • Sam Buss
  • , Dmitry Itsykson
  • , Alexander Knop
  • , Dmitry Sokolov

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

11 Scopus citations

Abstract

Atserias, 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 exponentially shorter proofs than dag-like cutting planes. This is proved by showing that the Clique-Coloring tautologies have polynomial size proofs in the OBDD(∧, weakening) system. The reordering rule allows changing the variable order for OBDDs. We show that OBDD (∧, weakening, reordering) is strictly stronger than OBDD(∧, weakening). This is proved using the Clique-Coloring tautologies, and by transforming tautologies using coded permutations and orification. We also give CNF formulas which have polynomial size OBDD(∧) proofs but require superpolynomial (actually, quasipolynomial size) resolution proofs, and thus we partially resolve an open question proposed by Groote and Zantema. Applying dag-like and tree-like lifting techniques to the mentioned results, we completely analyze which of the systems among CP∗, OBDD(∧), OBDD(∧, reordering), OBDD(∧, weakening) and OBDD (∧, weakening, reordering) polynomially simulate each other. For dag-like proof systems, some of our separations are quasipolynomial and some are exponential; for tree-like systems, all of our separations are exponential.

Original languageEnglish
Title of host publication33rd Computational Complexity Conference, CCC 2018
EditorsRocco A. Servedio
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages161-1624
Number of pages1464
ISBN (Electronic)9783959770699
DOIs
StatePublished - 1 Jun 2018
Externally publishedYes
Event33rd Computational Complexity Conference, CCC 2018 - San Diego, United States
Duration: 22 Jun 2018 → 24 Jun 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume102
ISSN (Print)1868-8969

Conference

Conference33rd Computational Complexity Conference, CCC 2018
Country/TerritoryUnited States
CitySan Diego
Period22/06/18 → 24/06/18

Keywords

  • Lifting theorems
  • OBDD
  • Proof complexity
  • The Clique-Coloring principle
  • Tseitin formulas

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Reordering rule makes OBDD proof systems stronger'. Together they form a unique fingerprint.

Cite this