A modern (trail saving, clause subsumption/vivification, learning-rate based selecting, rephrase) CDCL SAT solver in Rust
-
Updated
Sep 6, 2024 - Rust
A modern (trail saving, clause subsumption/vivification, learning-rate based selecting, rephrase) CDCL SAT solver in Rust
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 SAT Solver based on CDCL (Conflict Driven Clause Learning) implemented in python
Program Design affiliated to General Course Design of CSE College, HUST, for students enrolled in 2018.
A small SAT solver implementation. 2020年度の情報科学特別演習にて書いたプログラム
Command line tool for SAT solving, SMT solving in various theories (NRA, LRA, LIA, EQ, EQUF, BV)
A BDD library written in Rust to support a CDCL Sat Solver like Glucose, while running in parallel.
Lightweight but fast SAT solver with input sorting and CDCL
CDCL SAT Solver implementation for babies
Super efficient SAT solver in 500 lines of code
Sudoku solver using CaDiCaL SAT solver
My first SMT solver (only QF_UF)
CDCL SAT Solver from Scratch in Python
Add a description, image, and links to the cdcl topic page so that developers can more easily learn about it.
To associate your repository with the cdcl topic, visit your repo's landing page and select "manage topics."