Using Synthesis Techniques in SAT Solvers

In many application domains in VLSI CAD, like formal verification or test pattern generation, the problem to be solved can be formulated as an instance of satisfiability (SAT). The SAT instance in this cases is usually derived from a circuit description