SAT03 Using Problem Structure for Efficient Clause Learningsat03使用问题结构有效的条款学习.pptVIP

April 23, 2003 University of Washington Using Problem Structure for Efficient Clause Learning Ashish Sabharwal, Paul Beame, Henry Kautz University of Washington, Seattle April 23, 2003 The SAT Approach Key Facts Problem instances typically have structure Graphs, precedence relations, cause and effects Translation to CNF flattens this structure Best complete SAT solvers are DPLL based clause learners; branch and backtrack Critical: Variable order used for branching Natural Questions Can we extract structure efficiently? In translation to CNF formula itself From CNF formula From higher level de