Approximate Model Counter
-
Updated
Jun 25, 2025 - C++
Approximate Model Counter
UniGen approximately uniform sampler
A Free World Class High Performance SAT Solver
CMSGen, a fast weighted uniform-like sampler
Efficient and customizable CNF parser for SAT solving.
An ROBDD & CDCL based SAT solver
Random KCNF formulas generator and WalkSAT solver implementation for AI class at UNIFI
Parses conjunctive normal form hyperblock notation to parallel coordinate graph visualizations. Hyperblocks are an interpretable way to build machine learning models.
Conversor to WPM(1,3), dimacs format
In this repository I show how to perform a parallel BFS on graph constructed from CNF formulas.
Implementation of n x n SAT Sudoku solver using minisat
This program checks if an input CNF is satisfiable or not to check logical entailment.
✏ SAT approach for 8-queens problem
This project was designed to serve as a research-grade symbolic reasoning dashboard that helps others explore the bridge between computational logic and interactive visualization.
Modeling and solving Discovery of Drug Agencies(an NP class problem) as a SAT Problem. See the problem statement for more details.
Knowledgebase agent designed to solve a Minesweeper board
Export conclusions with resolution (resolution) / conclusions with forward chaining for (definite) Horn clauses of propositional logic
Boolean formula to CNF conversion, DPLL and CDCL SAT solving algorithms
A GNU Prolog programme to convert boolean expressions into CNF.
Add a description, image, and links to the cnf-clauses topic page so that developers can more easily learn about it.
To associate your repository with the cnf-clauses topic, visit your repo's landing page and select "manage topics."