cnf-clauses
There are 1 repository under cnf-clauses topic.
- slime-sat-solver
maxtuno / slime-sat-solver
A Free World Class High Performance SAT Solver
Language:JavaScript 20 Robbepop / cnf-parser
Efficient and customizable CNF parser for SAT solving.
Language:Rust 3alessandrobigiotti / Parallel_HornSatSolver
In this repository I show how to perform a parallel BFS on graph constructed from CNF formulas.
Language:Cuda 1- Language:Python 1
- Language:Python 1
Wadaboa / RandomKCNFSolver
Random KCNF formulas generator and WalkSAT solver implementation for AI class at UNIFI
Language:Python 1zakariamaaraki / SAT-Sudoku-solver
Implementation of n x n SAT Sudoku solver using minisat
Language:Java 1atulshgl / SAT-CNF
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.
Language:Python 0- Language:Java 0
kiancross / cnf-prolog
A GNU Prolog programme to convert boolean expressions into CNF.
Language:Prolog 0marccane / SAT-IT
Visual and interactive tool to visualize, learn about, and step through the resolution of SAT CNF formulas
Language:Java 0rshnn / minesweeper-knowledgebase-agent
Knowledgebase agent designed to solve a Minesweeper board
Language:Jupyter Notebook 0timbeurskens / gobdd
An ROBDD & CDCL based SAT solver
Language:Go 0wi11dey / Gates.jl
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.
Language:Julia 0dimglyn / propositional-logic
Export conclusions with resolution (resolution) / conclusions with forward chaining for (definite) Horn clauses of propositional logic
Language:Javalimo1996 / ProgramVerification1
Boolean formula to CNF conversion, DPLL and CDCL SAT solving algorithms
Language:SMTritu-thombre99 / Solving-CNF-SAT-using-DPLL
This program checks if an input CNF is satisfiable or not to check logical entailment.
Language:Jupyter Notebooktorland-klev / sat-solver
Automatically checks whether a given propositional formula is satisfiable.
Language:Javavinayak1998 / Discovery-of-Drug-Agencies
Modeling and solving Discovery of Drug Agencies(an NP class problem) as a SAT Problem. See the problem statement for more details.
Language:Python
