trolando / sylvanLinks
Implementation of multi-core (binary) decision diagrams
☆83Updated 5 months ago
Alternatives and similar repositories for sylvan
Users that are interested in sylvan are comparing it to the libraries listed below
Sorting:
- Multi-core Decision Diagram (BDD/LDD) implementation☆44Updated 2 years ago
- CUDD Decision Diagram Package☆151Updated last month
- Open-WBO: state-of-the-art MaxSAT and Pseudo-Boolean solver☆77Updated 2 years ago
- SAT Solver SATCH☆120Updated 3 years ago
- The glucose SAT solver☆136Updated last month
- Cube-and-Conquer SAT solver☆44Updated 6 months ago
- Lingeling SAT Solver☆106Updated last year
- ☆35Updated 6 months ago
- IC3 reference implementation: a short, simple, fairly competitive implementation of IC3. Read it, tune it, extend it, play with it.☆63Updated 10 years ago
- Binary Decision Diagrams (BDDs) in pure Python and Cython wrappers of CUDD, Sylvan, and BuDDy☆215Updated 2 months ago
- This repository contains the code of Intel(R) SAT Solver (IntelSAT)☆37Updated 10 months ago
- Approximate Model Counter☆82Updated 3 weeks ago
- The opensmt solver☆91Updated 3 weeks ago
- A Parallel SAT Solver with GPU Accelerated Inprocessing☆138Updated 2 months ago
- Pono: A flexible and extensible SMT-based model checker☆117Updated this week
- CaDiCaL SAT Solver☆514Updated this week
- configurable, high-performance SAT solver, implementing incremental solving interface of MiniSat and IPASIR. Based on MiniSat (minisat.se…☆41Updated 2 years ago
- The LTSmin model checking toolset☆61Updated last year
- SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers☆39Updated 3 years ago
- A generic C++ API for SMT solving. It provides abstract classes which can be implemented by different SMT solvers.☆139Updated last week
- Benchmarking Suite for BDD packages☆21Updated last week
- The Standard Interface for Incremental Satisfiability Solving☆51Updated 3 years ago
- ☆31Updated 4 months ago
- ☆14Updated 8 years ago
- ☆61Updated 2 months ago
- A Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions.☆355Updated last year
- Files and tools for SMT-COMP, the International Satisfiability Modulo Theories Competition.☆32Updated 11 months ago
- ☆17Updated last year
- An I/O-efficient implementation of (Binary) Decision Diagrams☆31Updated this week
- Tools from Pugh et al.'s "Omega Project" for constraint-based compiler tools: The "Omega Library" for constraint manipulation; The "Omega…☆72Updated 4 years ago