An advanced SAT solver

A SAT Solver based on CDCL (Conflict Driven Clause Learning) implemented in python

SAT solver based on CDCL in Python with Conflict Driven Clause Learning, clever Heuristics - VSIDS, 2 - Literal watch advanced data structure, Random restarts with restart probability decay

A simple SAT solver based on the CDCL algorithm

Simple SAT solver with CDCL implemented in Python

A Header-Only CDCL SAT Solver based on MiniSat (Fast and only 500 lines)

Implementation of basic CDCL-based SAT solver in Python

A small SAT solver implementation. 2020年度の情報科学特別演習にて書いたプログラム

Parallel SAT Solver

CDCL (Conflict-Driven Clause Learning) based SAT solver written in OCaml

Yet Another Sat solvER

CDCL SAT Solver implementation for babies

A CDCL SAT solver written in Golang(Go).

A DPLL sat solver accelerated by clause-driven-conflict-learning algorithm.

A theoretical and practical study of SAT solving, covering DPLL, CDCL, and restart optimisations through conceptual analysis and implementation. This is for my Undergraduate Dissertation at Royal Holloway University Of London.

CDCL based SAT Solver for boolean formulas in DIMACS CNF format

A CDCL SAT solver in C++23

Python implementation of a CDCL SAT solver with VSIDS decision heuristic and phase saving.

Reinforcement-Learning Controller for Variable Selection in the CaDiCaL SAT Solver — integrates a Python A2C policy with an instrumented CaDiCaL solver through a pybind11 bridge to learn variable-selection heuristics from a top-K candidate set on multiple SAT families. This Project served as my COS700 Honours Research at University of Pretoria.

C++ SAT solver using DPLL and CDCL algorithms to solve Boolean SAT problems supporting pure literal elimination, unit propagation, clause learning, and non-chronological backtracking.