lonsing / depqbfLinks
DepQBF, a solver for quantified boolean formulae (QBF).
☆39Updated 2 years ago
Alternatives and similar repositories for depqbf
Users that are interested in depqbf are comparing it to the libraries listed below
Sorting:
- The DRAT-trim proof checker☆67Updated 11 months ago
- The Standard Interface for Incremental Satisfiability Solving☆50Updated 3 years ago
- A fast and certifying solver for quantified Boolean formulas.☆26Updated 6 months ago
- The probSAT SAT Solver☆25Updated 3 years ago
- SAT Solver SATCH☆120Updated 3 years ago
- Cube-and-Conquer SAT solver☆40Updated 4 months ago
- ☆35Updated 3 months ago
- Qute: a dependency learning QBF solver.☆14Updated 11 months ago
- configurable, high-performance SAT solver, implementing incremental solving interface of MiniSat and IPASIR. Based on MiniSat (minisat.se…☆41Updated last year
- CAQE is a solver for quantified Boolean formulas☆35Updated 2 years ago
- Tools for manipulating CHC and related files☆15Updated 2 years ago
- LinearArbitrary-SeaHorn is a CHC solver for LLVM-based languages.☆22Updated 2 years ago
- IC3 reference implementation: a short, simple, fairly competitive implementation of IC3. Read it, tune it, extend it, play with it.☆62Updated 10 years ago
- Multi-core Decision Diagram (BDD/LDD) implementation☆43Updated 2 years ago
- There is a new version of dReal, available at https://github.com/dreal/dreal4☆50Updated 4 years ago
- This repository contains the code of Intel(R) SAT Solver (IntelSAT)☆33Updated 7 months ago
- A set of basic tools for manipulating SyGuS benchmarks☆25Updated 2 years ago
- ☆19Updated 2 years ago
- Approximate Model Counter☆79Updated last month
- High-performance model counter☆50Updated last week
- Specify and synthesize systems using symbolic algorithms☆51Updated last year
- A hardware model checker for hyperproperties☆18Updated last year
- Solver for Constrained Horn Clauses☆46Updated this week
- SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers☆37Updated 2 years ago
- Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability☆68Updated last year
- The LTSmin model checking toolset☆59Updated last year
- A model checker based on SAT solving and induction☆14Updated 10 years ago
- MONA - a decision procedure for monadic second-order logic on finite strings and trees☆53Updated 5 years ago
- ☆14Updated 7 years ago
- SRI Sally: A model checker for infinite-state systems.☆75Updated 3 months ago