Approximate Model Counter
-
Updated
Dec 21, 2025 - C++
#
dimacs-cnf
Here are 11 public repositories matching this topic...
Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability
optimization probability artificial-intelligence constraint-programming probabilistic-programming logic-programming sat-solver probabilistic answer-set-programming satisfiability differentiable-programming psat differentiable-satisfiability dimacs-cnf probabilistic-asp probabilistic-satisfiability multi-models-optimization weighted-sat-solving
-
Updated
Jul 1, 2024 - Scala
UniGen approximately uniform sampler
-
Updated
Jul 24, 2025 - C++
CNF minimizer and minimal independent set minimizer
-
Updated
Jan 9, 2026 - C++
CDCL SAT Solver implemented in C++ using watches and restarts
-
Updated
Oct 26, 2023 - C++
a set of Boolean logic functions and SAT solvers
python sat-solver dpll-algorithm boolean-logic vanilla-python unit-propagation dimacs-cnf pure-literal-elimination
-
Updated
May 24, 2025 - Python
Encodes, solves, and decodes the exact cover problem via reduction to SAT
-
Updated
Nov 21, 2024 - Python
Curated collection of 100+ SAT problem instances with difficulty taxonomy, solver metrics, and interactive HTML viewer
benchmark research cnf sat-solver constraint-satisfaction dimacs satisfiability dimacs-cnf solver-testing sat-instances sat-benchmarks
-
Updated
Dec 12, 2025 - HTML
Structured BVA CNF rewriter
-
Updated
Nov 28, 2025 - C++
Improve this page
Add a description, image, and links to the dimacs-cnf topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the dimacs-cnf topic, visit your repo's landing page and select "manage topics."