Approximate Model Counter
-
Updated
Jul 21, 2026 - C++
Approximate Model Counter
Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability
UniGen approximately uniform sampler
CDCL SAT Solver implemented in C++ using watches and restarts
a set of Boolean logic functions and SAT solvers
Encodes, solves, and decodes the exact cover problem via reduction to SAT
SAT solver (DPLL) for DIMACS CNF, with folder solving and benchmark export.
DIMACS CNF toolkit for Max-SAT and SAT optimization
Curated collection of 100+ SAT problem instances with difficulty taxonomy, solver metrics, and interactive HTML viewer
Add a description, image, and links to the dimacs-cnf topic page so that developers can more easily learn about it.
To associate your repository with the dimacs-cnf topic, visit your repo's landing page and select "manage topics."