Codes and experimental results for paper《Computing Minimal Model Based on MiniSAT》
-
Updated
Oct 26, 2021 - C++
Codes and experimental results for paper《Computing Minimal Model Based on MiniSAT》
The SAT solver checks if the given CNF formula evaluates to true for some arbitrary input combinations.
Analyzed algorithmic efficiency of three approaches to solving the minimum vertex cover for undirected graphs of various sizes.
A Quick Conflict Driven SAT Solver
Graph-based DPLL-SAT Solver for propositional logic formulas in XOR-OR-AND normal form (XNF).
A collaborative parallel SAT solver for teens
Just good ol' minisat with some quality of life improvements and weak/strong assumptions
OCaml bindings for the Glucose SAT solver (not really working, work in progress)
A (parallel) implementation of the classic DPLL algorithm using Cilk
Developing Mastermind Game LOGIC using C++ Programming and SAT solver
SAT Solver NPM Package written in C++
Add a description, image, and links to the sat-solver topic page so that developers can more easily learn about it.
To associate your repository with the sat-solver topic, visit your repo's landing page and select "manage topics."