BDD-Guided Clause Generation

@inproceedings{Kell2015BDDGuidedCG,
  title={BDD-Guided Clause Generation},
  author={Brian Kell and Ashish Sabharwal and Willem Jan van Hoeve},
  booktitle={CPAIOR},
  year={2015}
}
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… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 24 REFERENCES

Multivalued Decision Diagrams for Sequencing Problems

VIEW 3 EXCERPTS