120 likes | 271 Views
Simultaneous CNF Encoder Optimization with SAT solver Setting Selection. 0526 CAD_A. Outline. Problem Description Evaluation Conjunctive Normal Form (CNF) DIMACS CNF Strategy Experimental Result Future Work. Problem Description. Flow chart. 3. 10. Problem Description.
E N D
Simultaneous CNF Encoder Optimization with SAT solver Setting Selection 0526 CAD_A
Outline • Problem Description • Evaluation • Conjunctive Normal Form (CNF) • DIMACS CNF • Strategy • Experimental Result • Future Work
Problem Description • Flow chart 3 10
Problem Description Exploration phase Solving phase
Evaluation • Results should be correct • 2 open cases • 10 hidden cases >1800s: cost = 3000 t1 < 25s t2 < 100s cost of each “test”: 4 × t1 + t2 300 Total cost: sum of 12 cases
DIMACS CNF • p cnf NUMBER_OF_VARIABLES NUMBER_OF_CLAUSES • "c" means a comment line • clause • end of every clause -> “0” c Here is a comment. p cnf 5 3 1 -5 4 0 -1 5 3 4 0 -3 -4 0 (x1⋁¬x5⋁x4⋁)⋀(¬x1⋁x5⋁x3⋁x4)⋀(¬x3⋁¬x4)
SAT solvers • Use only one (for each case) in single command line • Lingelingats (in name lingeline) • http://fmv.jku.at/lingeling/lingeling-ats-57807c8-131016.tar.gz • Glucose 3.0 (in name glucose) • http://www.labri.fr/perso/lsimon/downloads/softwares/glucose-3.0.tgz • Minisat 2.2 (in name minisat) • http://minisat.se/downloads/minisat-2.2.0.tar.gz
Strategy • Reduce netlist • resyn2 • NAR • Reduce CNF • Clause Elimination • Clause Reordering netlist CNF
CNF Clause Reordering c Here is a comment. p cnf 5 3 1 -5 4 0 2+2+3 -1 5 3 4 0 2+2+2+3 -3 -4 0 2+3 c Here is a comment. p cnf 5 3 -1 5 3 4 0 2+2+2+3 1 -5 4 0 2+2+3 -3 -4 0 2+3
Future Work • Circuit Reduction • Clause Elimination