IJCAI03 Understanding the Power of Clause Learningijcai03理解从句学习的力量.pptVIP

Aug 14, 2003 University of Washington, Seattle Understanding the Power ofClause Learning Ashish Sabharwal, Paul Beame, Henry Kautz University of Washington, Seattle IJCAI Conference Aug 14, 2003 SAT: The Satisfiability Problem Given a CNF formula F, [e.g. F = (a ? b) ? (?a ? c) ? ?a ] determine if F has a satisfying assignment SAT Solver: DPLL Algorithm Best complete CNF (un)satisfiability algorithms in practice are extensions of the DPLL algorithm [Davis-Putnam 60] [Davis-Logeman-Loveland 62] Recursive backtrack search Search space pruning based on falsified clauses DPLL Al