Satisfiability in the Year 2005
Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
Symbolic Techniques in Satisfiability Solving
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
Backdoor Sets for DLL Subsolvers
The Complexity of Pure Literal Elimination
Clause Weighting Local Search for SAT
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search
Regular Random k-SAT
Applying SAT Solving in Classification of Finite Algebras
The SAT-based Approach to Separation Logic
MATHSAT