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

This project implements multiple solvers for the Gem Hunter (originally from the game Minesweeper) game and compares the performance.

Random KCNF formulas generator and WalkSAT solver implementation for AI class at UNIFI

In this repository I show how to perform a parallel BFS on graph constructed from CNF formulas.

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 program checks if an input CNF is satisfiable or not to check logical entailment.

Implementation of n x n SAT Sudoku solver using minisat

Export conclusions with resolution (resolution) / conclusions with forward chaining for (definite) Horn clauses of propositional logic

✏ SAT approach for 8-queens problem

Projects Knowledge Representation and Reasoning (KRR), MSc Artificial Intelligence, Year 1, Semester 1, Faculty of Mathematics and Computer Science, University of Bucharest

Convert logical problem to CNF

Modeling and solving Discovery of Drug Agencies(an NP class problem) as a SAT Problem. See the problem statement for more details.

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.