thtran97 / Local-Search-for-SAT
Implementation of local search-based algorithms for solving SAT and Max-SAT in Python
☆13Updated 4 years ago
Alternatives and similar repositories for Local-Search-for-SAT:
Users that are interested in Local-Search-for-SAT are comparing it to the libraries listed below
- Official repository for paper "Goal-Aware Neural SAT Solver"☆15Updated last year
- [TMLR 2024] G4SATBench: Benchmarking and Advancing SAT Solving with Graph Neural Networks☆35Updated 9 months ago
- ☆34Updated 7 months ago
- PyTorch implementation of NeuroSAT☆28Updated last year
- Parallel SAT solver that won the SAT Competition 2022 by a large margin (24% faster than the 2nd ranked solver)☆22Updated 2 years ago
- NeuroCore: Guiding CDCL with Unsat-Core Predictions☆44Updated 5 years ago
- A fast and certifying solver for quantified Boolean formulas.☆26Updated 9 months ago
- 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 5 months ago
- The first scalable probabilistic exact counter☆28Updated 10 months ago
- Cube-and-Conquer SAT solver☆32Updated last year
- Learning local search heuristics for Boolean satisfiability☆37Updated 9 months ago
- A Simple CDCL Solver☆28Updated last year
- py-aiger: A python library for manipulating sequential and combinatorial circuits encoded using `and` & `inverter` gates (AIGs).☆42Updated 2 months ago
- ☆15Updated 11 months ago
- Parallel SAT Solver☆10Updated 7 years ago
- The glucose SAT solver☆92Updated 3 months ago
- Simple SAT solver with CDCL implemented in Python☆16Updated 2 years ago
- A Python API for the MiniSat and MiniCard constraint solvers.☆19Updated last year
- Distributed and ressource elastic cube-and-conquer SAT & QBF solver☆18Updated 2 years ago
- CAV'22 paper to speed up Neural Network Verification.☆14Updated 2 years ago
- The top three SAT solvers of 2021: kissat-MAB, lstech_maple, and kissat_gb.☆21Updated 3 years ago
- DepQBF, a solver for quantified boolean formulae (QBF).☆34Updated last year
- propositional satisfiability problem (SAT) goes neural and deep☆12Updated 3 years ago
- Encoding different problems into Boolean satisfiability☆11Updated 2 years ago
- ☆10Updated last year
- ☆15Updated last year
- Using GNN and DQN to find a baetter branching heuristic for a CDCL Solver☆53Updated 4 years ago
- SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers☆38Updated 2 years ago
- A framework to ease parallelization of sequential SAT solvers☆15Updated 3 months ago