An advanced SAT solver

Simple Theorem Prover, an efficient SMT solver for bitvectors

Bosphorus, ANF simplifier and solver, and ANF-to-CNF converter

CNF minimizer and minimal independent set minimizer

CGen is a tool for encoding SHA-1 and SHA-256 hash functions into CNF in DIMACS format, also into ANF polynominal system in PolyBoRi output format.

DenseQMC: A bit-slice implementation of the Quine-McCluskey algorithm

CMSGen, a fast weighted uniform-like sampler

BreakID, a CNF symmetry-breaking library and tool

SLIME Cloud: A Free Massive World Class High Performance SAT Solver, Winner of Crypto Track and 3rd place on Cloud Track at the SAT Competition 2021.

SAT'18 Paper: SPUR - Satisfying Perfectly Uniform Random sampler (Winner Best Student Paper)

Compile MiniSat to WebAssembly using emscripten

Windows builds for The Glucose SAT Solver.

CNF to d-DNNF compiler

COP6726 - Database System Implementation - Database From Scratch

Hydra is the development repository for the Bella knowledge compiler and the Cara #SAT solver

DB implementation - Heap file, Sorted file, RelOps, Query Engine - systems programming

GaussMaxHS, a CNF+XOR MaxSAT solver

The CFL Reachability problem involves determining whether there is a path in a graph where the concatenation of edge labels along the path forms a string that belongs to a given context-free language.

Compile SPUR to WebAssembly using emscripten

Library for working with binary logic and satisfiability equations