Structure-based satisfiability checking
Matti Järvisalo · AI Communications · 2009
This note summarizes a dissertation that focuses on methods for solving structured real-world problems based on propositional satisfiability (SAT). The work contributes to the analysis and development of both complete search (DPLL and clause learning