BreakID, a CNF symmetry-breaking library and tool
-
Updated
Jul 15, 2024 - C++
BreakID, a CNF symmetry-breaking library and tool
The first scalable probabilistic exact counter
SAT'18 Paper: SPUR - Satisfying Perfectly Uniform Random sampler (Winner Best Student Paper)
DenseQMC: A bit-slice implementation of the Quine-McCluskey algorithm
CGen is a tool for encoding SHA-1 and SHA-256 hash functions into CNF in DIMACS format, also into ANF polynominal system in PolyBoRi output format.
Just good ol' minisat with some quality of life improvements and weak/strong assumptions
This repository contains projects done by undergraduate students of IIT Jodhpur in the areas of Indigenous Digital Design and Electronic Design Automation (IDDEDA).
Encoding different problems into Boolean satisfiability
Tool to check if a conditional behavior tree (CBT) is valid
The Standard Interface for Incremental Satisfiability Solving
Optimized 32-Bit Full Adder, CEC-SAT Verifier & 2-SAT Solver
Minimal Independent Set Finder for CNFs
A random testing tool for IPASIR SAT solvers
A Header-Only CDCL SAT Solver based on MiniSat (Fast and only 500 lines)
📈 Implementation of a SAT solver to solve satisfiability problems.
A SAT-based forward/backwards solver for Conway's "Game of Life".
Add a description, image, and links to the satisfiability topic page so that developers can more easily learn about it.
To associate your repository with the satisfiability topic, visit your repo's landing page and select "manage topics."