There are 1 repository under cnf-clauses topic.
A Free World Class High Performance SAT Solver
Efficient and customizable CNF parser for SAT solving.
In this repository I show how to perform a parallel BFS on graph constructed from CNF formulas.
Random KCNF formulas generator and WalkSAT solver implementation for AI class at UNIFI
Implementation of n x n SAT Sudoku solver using minisat
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.
A GNU Prolog programme to convert boolean expressions into CNF.
Visual and interactive tool to visualize, learn about, and step through the resolution of SAT CNF formulas
Knowledgebase agent designed to solve a Minesweeper board
An ROBDD & CDCL based SAT solver
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.
Export conclusions with resolution (resolution) / conclusions with forward chaining for (definite) Horn clauses of propositional logic
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
This program checks if an input CNF is satisfiable or not to check logical entailment.
Automatically checks whether a given propositional formula is satisfiable.
Modeling and solving Discovery of Drug Agencies(an NP class problem) as a SAT Problem. See the problem statement for more details.