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 ...
GitHub

Python SAT Solver (DPLL + CDCL + VSIDS) – A from-scratch implementation of modern SAT solving algorithms with clause learning, non-chronological backtracking, heuristics, and ...

This project is my independent research into SAT solvers written entirely in Python, designed to explore the theory and practice of propositional satisfiability. It begins with a baseline DPLL ...
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 ...