GitHub

SAT Solver Implementation with DPLL, CDCL, and VSIDS Heuristics

This project implements a SAT solver using the DPLL algorithm with Conflict-Driven Clause Learning (CDCL) and Variable State Independent Decaying Sum (VSIDS) heuristics in C++. It is designed to read ...
GitHub

Implementation of three SAT Solver algorithms: DPLL, WalkSAT, and GSAT. Included is a file of Conjutive Normal Form (CNF) formulas that are solved using the algorithms.

DPLL is a backtracking-based algorithm that combines unit propagation and pure literal elimination. It explores all possible variable assignments until it finds a solution or proves the formula is ...
IEEE

Arithmetic reasoning in DPLL-based SAT solving

Abstract: We propose a new arithmetic reasoning calculus to speed up a SAT solver based on the Davis Putnam Longman Loveland (DPLL) procedure. It is based on an arithmetic bit level description of the ...