Extending Existential Quantification in Conjunctions of BDDs

  title={Extending Existential Quantification in Conjunctions of BDDs},
  author={Sean A. Weaver and John V. Franco and John S. Schlipf},
We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula φ expressed as a conjunction of Boolean functions. A common practice in such cases, when using constraint-oriented methods, is to represent the functions as BDDs, then repeatedly cluster BDDs containing one or more variables, and finally existentially quantify those variables away from the cluster. Clustering is essential because, in general, existential quantification cannot be applied… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 16 references

State-based propositional Satisfiability Solver

  • J. Franco, M. Dransfield, W. M. Vanfleet, J. S. Schlipf
  • US Patent Application Serial No. 10/164,203,
  • 2005

Using ordered binary decision diagrams to solve highly structured satisfiability problems

  • M. Dransfield, R. E. Bryant
  • Unpublished technical report CMU-CS-1996,
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…