ChiLai Huang

  • Citations Per Year
Learn More
Binary Decision Diagrams have been widely used to solve the Boolean Satisfiability (SAT) problem. The individual constraints can be represented using BDDs and the conjunction of all constraints provides all satisfying solutions. However, BDD-related SAT techniques suffer from size explosion problems. This paper presents two BDD-based algorithms to solve the(More)
  • 1