BDD-Guided Clause Generation

  • Brian Kell
  • Ashish Sabharwal
  • Willem-Jan van Hoeve
Conference paper

DOI: 10.1007/978-3-319-18008-3_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9075)
Cite this paper as:
Kell B., Sabharwal A., van Hoeve WJ. (2015) BDD-Guided Clause Generation. In: Michel L. (eds) Integration of AI and OR Techniques in Constraint Programming. CPAIOR 2015. Lecture Notes in Computer Science, vol 9075. Springer, Cham


Nogood learning is a critical component of Boolean satisfiability (SAT) solvers, and increasingly popular in the context of integer programming and constraint programming. We present a generic method to learn valid clauses from exact or approximate binary decision diagrams (BDDs) and resolution in the context of SAT solving. We show that any clause learned from SAT conflict analysis can also be generated using our method, while, in addition, we can generate stronger clauses that cannot be derived from one application of conflict analysis. Importantly, since SAT instances are often too large for an exact BDD representation, we focus on BDD relaxations of polynomial size and show how they can still be used to generated useful clauses. Our experimental results show that when this method is used as a preprocessing step and the generated clauses are appended to the original instance, the size of the search tree for a SAT solver can be significantly reduced.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Brian Kell
    • 1
  • Ashish Sabharwal
    • 2
  • Willem-Jan van Hoeve
    • 3
  1. 1.Department of Mathematical SciencesCarnegie Mellon UniversityPittsburghUSA
  2. 2.Allen Institute for Artificial IntelligenceSeattleUSA
  3. 3.Tepper School of BusinessCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations