Alternatives and similar repositories for lingeling:

Users that are interested in lingeling are comparing it to the libraries listed below

• arminbiere / satch
  SAT Solver SATCH
  ☆114Updated 2 years ago
• marijnheule / CnC
  Cube-and-Conquer SAT solver
  ☆32Updated last year
• meelgroup / approxmc
  Approximate Model Counter
  ☆73Updated 7 months ago
• arminbiere / cadical
  CaDiCaL SAT Solver
  ☆409Updated this week
• arminbiere / gimsatul
  ☆34Updated 7 months ago
• conp-solutions / mergesat
  configurable, high-performance SAT solver, implementing incremental solving interface of MiniSat and IPASIR. Based on MiniSat (minisat.se…
  ☆41Updated last year
• marijnheule / microsat
  microsat
  ☆132Updated 2 years ago
• audemard / glucose
  The glucose SAT solver
  ☆92Updated 3 months ago
• arminbiere / kissat
  ☆500Updated 3 weeks ago
• sat-group / open-wbo
  Open-WBO: state-of-the-art MaxSAT and Pseudo-Boolean solver
  ☆76Updated last year
• biotomas / ipasir
  The Standard Interface for Incremental Satisfiability Solving
  ☆49Updated 2 years ago
• marijnheule / drat-trim
  The DRAT-trim proof checker
  ☆54Updated 2 months ago
• maximaximal / Paracooba
  Distributed and ressource elastic cube-and-conquer SAT & QBF solver
  ☆18Updated 2 years ago
• ivmai / cudd
  CUDD: CU Decision Diagram package - unofficial git mirror of https://web.archive.org/web/20180127051756/http://vlsi.colorado.edu/~fabio/C…
  ☆125Updated last year
• muhos / ParaFROST
  A Parallel SAT Solver with GPU Accelerated Inprocessing
  ☆94Updated 5 months ago
• meelgroup / bosphorus
  Bosphorus, ANF simplifier and solver, and ANF-to-CNF converter
  ☆68Updated 3 months ago
• usi-verification-and-security / opensmt
  The opensmt solver
  ☆79Updated this week
• Laakeri / sharpsat-td
  Entry to model counting competition 2021.
  ☆20Updated 7 months ago
• stanford-centaur / smt-switch
  A generic C++ API for SMT solving. It provides abstract classes which can be implemented by different SMT solvers.
  ☆120Updated this week
• Boolector / boolector
  A Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions.
  ☆341Updated 5 months ago
• arbrad / IC3ref
  IC3 reference implementation: a short, simple, fairly competitive implementation of IC3. Read it, tune it, extend it, play with it.
  ☆56Updated 9 years ago
• FlorentAvellaneda / EvalMaxSAT
  State-of-the-art MaxSAT Solver & Library Based on Unsat Core Guided Techniques
  ☆16Updated 10 months ago
• pysathq / pysat
  A toolkit for SAT-based prototyping in Python
  ☆407Updated 3 weeks ago
• meelgroup / KCBox
  A toolbox for knowledge compilation
  ☆20Updated 3 weeks ago
• sat-heritage / docker-images
  SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers
  ☆38Updated 2 years ago
• hgarrereyn / SBVA
  Structured BVA
  ☆33Updated 9 months ago
• marcthurley / sharpSAT
  The #SAT solver sharpSAT
  ☆56Updated 2 years ago
• meelgroup / ganak
  The first scalable probabilistic exact counter
  ☆28Updated 10 months ago
• stanford-centaur / pono
  Pono: A flexible and extensible SMT-based model checker
  ☆90Updated last week
• fbacchus / MaxHS
  MaxHS: a hybrid Maxsat solver developed by Jessica Davies and Fahiem Bacchus
  ☆25Updated 3 years ago