An advanced SAT solver

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 SAT Solver based on CDCL (Conflict Driven Clause Learning) implemented in python

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

Parallel SAT Solver

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

Implementation of basic CDCL-based SAT solver in Python

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

Yet Another Sat solvER

A CDCL SAT solver written in Golang(Go).

CDCL SAT Solver implementation for babies

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

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

CDCL based SAT Solver for boolean formulas in DIMACS CNF format

A collaborative parallel SAT solver for teens

SAT solver using DPLL and CDCL algorithms to solve Boolean SAT problems supporting pure literal elimination, unit propagation, clause learning, and non-chronological backtracking. Benchmarked using SATLIB test cases, with performance evaluated through runtime analysis

Boolean formula to CNF conversion, DPLL and CDCL SAT solving algorithms

This project was done as part of the COL876 (SAT Solvers and Automated Reasoning) course requirements. This is a simple implementation of a CDCL-based SAT Solver. The solver involves some tried-and-tested heuristics and their results in the report.