Implementing a High-Performance SAT Solver with CDCL and 2-Literal Watching Mechanisms
Overview
The Satisfiability Problem (SAT) is a fundamental decision problem in computer science, asking whether there exists an interpretation that satisfies a given Boolean formula. This implementation details a high-performance SAT solver based on the Davis-Putnam-Logemann-Loveland (DPLL) algorithm, enhanced with modern Conflict-Driven Clause ...
Posted on Wed, 12 Aug 2026 16:37:25 +0000 by planethax