A Javascript API for the MiniSat and MiniCard constraint solvers.
-
Updated
Sep 24, 2024 - C++
A Javascript API for the MiniSat and MiniCard constraint solvers.
A (parametrized) Rust SAT solver originally based on MiniSat
CreuSAT - A formally verified SAT solver written in Rust and verified with Creusot.
An Algorithm to Minimize The SAT Model Returned By a SAT Solver
🗿 SAT solver wrappers for Kotlin
RSAT
A new fast, light and comprehensive Sudoku library, powered by SAT encoding!
A Python API for the MiniSat and MiniCard constraint solvers.
Testing and Verification of VLSI Circuits - Spring Semester 2023 - Indian Institute of Technology Bombay
Just good ol' minisat with some quality of life improvements and weak/strong assumptions
Faithful reimplementation of Minisat 2.2 in OCaml.
Discrete Optimization Algorithms
Finding shortest path and minimum vertex cover of the street graph.
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…
Windows builds for The Glucose SAT Solver.
A Header-Only CDCL SAT Solver based on MiniSat (Fast and only 500 lines)
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."