A Header-Only CDCL SAT Solver for Programming Contest
-
Updated
Oct 2, 2019 - C++
A Header-Only CDCL SAT Solver for Programming Contest
A Python API for the MiniSat and MiniCard constraint solvers.
Compile MiniSat to WebAssembly using emscripten
Collection of assignments given by Prof. Mausam in the COL333 course
Check to see if a mapping exists between 2 graphs (subgraph-isomorphism) by developing optimised SAT clauses and solving them using MINISAT.
Finding shortest path and minimum vertex cover of the street graph.
Windows builds for The Glucose SAT Solver.
Discrete Optimization Algorithms
A Minisat-based solver for 9*9 sudoku boards.
Just good ol' minisat with some quality of life improvements and weak/strong assumptions
A SAT-based forward/backwards solver for Conway's "Game of Life".
Combinational Logic Circuits SAT analyzer.
Program that gets from user or randomly generates streets (multilinear segment approximation) with name and segment coordinates, gets the graph formed by the streets with intersections and adjacent street nodes as vertices, and finds shortest path (one of) between any 2 nodes of the resultant undirected and unweighted graph. Vertex Cover program…
A Header-Only CDCL SAT Solver based on MiniSat (Fast and only 500 lines)
A simple partial unweighted MaxSAT Solver that uses a Minisat backbone
Add a description, image, and links to the minisat topic page so that developers can more easily learn about it.
To associate your repository with the minisat topic, visit your repo's landing page and select "manage topics."