Automatically checks whether a given propositional formula is satisfiable.

Efficient and customizable CNF parser for SAT solving.

Convert logical problem to CNF

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

✏ SAT approach for 8-queens problem

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

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

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.

A fast circuit compiler that can seamlessly integrate with existing Julia code and can incrementally build up expressions and regenerate optimized circuits after substitutions and manipulations using standard Julia functions.

Conversor to WPM(1,3), dimacs format

Given a relationship matrix among guests, output the seating arrangement. The program converts the relationship matrix into CNF clauses and finds a solution (SAT) using DPLL algorithm.

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

Boolean formula to CNF conversion, DPLL and CDCL SAT solving algorithms

An ROBDD & CDCL based SAT solver

A GNU Prolog programme to convert boolean expressions into CNF.

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

Knowledgebase agent designed to solve a Minesweeper board

A Free World Class High Performance SAT Solver

Visual and interactive tool to visualize, learn about, and step through the resolution of SAT CNF formulas