daajoe / GPUSAT
☆11Updated 3 years ago
Alternatives and similar repositories for GPUSAT:
Users that are interested in GPUSAT are comparing it to the libraries listed below
- Source code for GpuShareSat, a library for SAT solvers to use the GPU for clause sharing between CPU threads.☆32Updated 3 years ago
- Metal: Learning a Meta-Solver for Syntax-Guided Program Synthesis☆15Updated 6 years ago
- A fast and certifying solver for quantified Boolean formulas.☆26Updated 10 months ago
- NeuroCore: Guiding CDCL with Unsat-Core Predictions☆44Updated 5 years ago
- DepQBF, a solver for quantified boolean formulae (QBF).☆34Updated last year
- Multi-core Decision Diagram (BDD/LDD) implementation☆42Updated last year
- ☆37Updated 11 months ago
- ☆16Updated 3 years ago
- ☆34Updated 8 months ago
- SMT-LIB benchmarks for shape computations from deep learning models in PyTorch☆18Updated 2 years ago
- ☆11Updated 7 years ago
- MachSMT: An ML-Driven Algorithm Selection tool for SMT Solvers☆21Updated last year
- The probSAT SAT Solver☆22Updated 2 years ago
- A Python API for the MiniSat and MiniCard constraint solvers.☆20Updated last year
- Distributed and ressource elastic cube-and-conquer SAT & QBF solver☆18Updated 2 years ago
- Code for the NeurIPS 2020 paper Efficient Exact Verification of Binarized Neural Networks☆13Updated 2 years ago
- configurable, high-performance SAT solver, implementing incremental solving interface of MiniSat and IPASIR. Based on MiniSat (minisat.se…☆41Updated last year
- The Standard Interface for Incremental Satisfiability Solving☆49Updated 2 years ago
- A continuous local search SAT solver based on Fourier expansion for hybrid Boolean constraints.☆12Updated 6 months ago
- ☆15Updated last year
- Cube-and-Conquer SAT solver☆32Updated last year
- The first scalable probabilistic exact counter☆31Updated this week
- A Parallel SAT Solver with GPU Accelerated Inprocessing☆94Updated 6 months ago
- A model checker based on SAT solving and induction☆13Updated 9 years ago
- Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability☆63Updated 8 months ago
- SMTSampler: Efficient Stimulus Generation from Complex SMT Constraints☆24Updated 5 years ago
- ☆11Updated 8 months ago
- This repository contains the code of Intel(R) SAT Solver (IntelSAT)☆28Updated 3 weeks ago
- PolyGen is a code generator for the polyhedral model, written and proved in Coq.☆10Updated 4 years ago