Approximate Model Counter
-
Updated
Mar 10, 2026 - C++
Approximate Model Counter
UniGen approximately uniform sampler
A Free World Class High Performance SAT Solver
CMSGen, a fast weighted uniform-like sampler
An ROBDD & CDCL based SAT solver
Efficient and customizable CNF parser for SAT solving.
Looking for solutions of certain sizes with Glucose, Kissat and CaDiCaL
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
This project implements multiple solvers for the Gem Hunter (originally from the game Minesweeper) game and compares the performance.
This program checks if an input CNF is satisfiable or not to check logical entailment.
Implementation of n x n SAT Sudoku solver using minisat
In this repository I show how to perform a parallel BFS on graph constructed from CNF formulas.
Knowledgebase agent designed to solve a Minesweeper board
Export conclusions with resolution (resolution) / conclusions with forward chaining for (definite) Horn clauses of propositional logic
Projects Knowledge Representation and Reasoning (KRR), MSc Artificial Intelligence, Year 1, Semester 1, Faculty of Mathematics and Computer Science, University of Bucharest
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.
✏ SAT approach for 8-queens problem
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."