Boolean Satisfiability (SAT) Algorithms

Converting a Circuit to a CNF
Circuit_to_CNF(Circuit c)
Assign one variable to each gate in the circuit,
including PIs
For each gate in the circuit, generate the clauses
for the characteristic function of this gate
Conjunct all the clauses in step 2, return the CNF
Write_CNF(gate g)
Enumerate all the forward implications of this gate
For each implication, generate a clause by the
rule: p q ≡ (p’ + q)
Boolean SAT Algorithms / FLOLAC 2009 Prof. Chung-Yang (Ric) Huang http://dvlab.ee.ntu.edu.tw
90