Sciweavers

DAC
2003
ACM
15 years 15 days ago
Checking satisfiability of a conjunction of BDDs
Procedures for Boolean satis ability most commonly work with Conjunctive Normal Form. Powerful SAT techniques based on implications and con icts can be retained when the usual CNF...
Robert F. Damiano, James H. Kukula