A Lightweight Component Caching Scheme for Satisfiability Solvers

Abstract We introduce in this paper a lightweight technique for reducing work repetition caused by non–chronological backtracking commonly practiced by DPLL–based SAT solvers. The presented technique can be viewed as a partial component caching scheme. Empirical evaluation of the technique reveals significant improvements on a broad range of industrial instances.

Authors

• Knot Pipatsrisawat
• Adnan Darwiche

Keywords

No keywords are indexed for this paper.