An advanced SAT solver

Simple Theorem Prover, an efficient SMT solver for bitvectors

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

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.

CNF minimizer and minimal independent set calculator

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

CMSGen, a fast weighted uniform-like sampler

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

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.

Windows builds for The Glucose SAT Solver.

BreakID, a CNF symmetry-breaking library and tool

Compile MiniSat to WebAssembly using emscripten

COP6726 - Database System Implementation - Database From Scratch

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.

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

GaussMaxHS, a CNF+XOR MaxSAT solver

Compile SPUR to WebAssembly using emscripten

Library for working with binary logic and satisfiability equations

Solving LightUp problems with minisat