dtompkins / ubcsatLinks
The Stochastic Local Search SAT Solver from UBC
☆32Updated 3 years ago
Alternatives and similar repositories for ubcsat
Users that are interested in ubcsat are comparing it to the libraries listed below
Sorting:
- A Python API for the MiniSat and MiniCard constraint solvers.☆22Updated 5 months ago
- Open-WBO: state-of-the-art MaxSAT and Pseudo-Boolean solver☆78Updated 2 years ago
- DepQBF, a solver for quantified boolean formulae (QBF).☆39Updated 2 years ago
- MiniCard: An efficient cardinality solver based on MiniSAT☆17Updated 5 months ago
- CNF generator in DIMACS format. It produces common families of CNFs.☆69Updated 4 months ago
- Simple recursive and iterative SAT solver written in Python.☆123Updated 6 years ago
- Binary Decision Diagrams (BDDs) in pure Python and Cython wrappers of CUDD, Sylvan, and BuDDy☆212Updated last week
- Cube-and-Conquer SAT solver☆41Updated 5 months ago
- configurable, high-performance SAT solver, implementing incremental solving interface of MiniSat and IPASIR. Based on MiniSat (minisat.se…☆41Updated 2 years ago
- NeuroCore: Guiding CDCL with Unsat-Core Predictions☆47Updated 5 years ago
- The Pseudo-Boolean Solver MiniSat+☆29Updated 13 years ago
- The Standard Interface for Incremental Satisfiability Solving☆50Updated 3 years ago
- Specify and synthesize systems using symbolic algorithms☆51Updated this week
- ☆11Updated 4 years ago
- A research platform and active library for generalised SAT solving☆33Updated 6 months ago
- The probSAT SAT Solver☆26Updated 3 years ago
- There is a new version of dReal, available at https://github.com/dreal/dreal4☆50Updated 4 years ago
- Distributed and ressource elastic cube-and-conquer SAT & QBF solver☆20Updated 2 years ago
- SAT Solver SATCH☆120Updated 3 years ago
- An interface to SAT solver tools (like minisat)☆62Updated this week
- Multi-core Decision Diagram (BDD/LDD) implementation☆44Updated 2 years ago
- BuDDy Binary Decision Diagram(BDD) library provisioned with CMake files☆14Updated 8 years ago
- A benchmark library for constraints☆98Updated last month
- Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability☆69Updated last year
- A continuous local search SAT solver based on Fourier expansion for hybrid Boolean constraints.☆12Updated last year
- The DRAT-trim proof checker☆68Updated last year
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆59Updated 2 years ago
- A fast and certifying solver for quantified Boolean formulas.☆26Updated 7 months ago
- This repository contains the code of Intel(R) SAT Solver (IntelSAT)☆36Updated 8 months ago
- A set of basic tools for manipulating SyGuS benchmarks☆25Updated 2 years ago