Alternatives and similar repositories for ipasir

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

• marijnheule / drat-trim
  The DRAT-trim proof checker
  ☆67Updated last year
• arminbiere / satch
  SAT Solver SATCH
  ☆120Updated 3 years ago
• lonsing / depqbf
  DepQBF, a solver for quantified boolean formulae (QBF).
  ☆39Updated 2 years ago
• utwente-fmt / sylvan
  Multi-core Decision Diagram (BDD/LDD) implementation
  ☆44Updated 2 years ago
• audemard / glucose
  The glucose SAT solver
  ☆126Updated 5 months ago
• alexander-nadel / intel_sat_solver
  This repository contains the code of Intel(R) SAT Solver (IntelSAT)
  ☆33Updated 8 months ago
• sat-group / open-wbo
  Open-WBO: state-of-the-art MaxSAT and Pseudo-Boolean solver
  ☆77Updated 2 years ago
• arminbiere / gimsatul
  ☆35Updated 4 months ago
• PetterS / qepcad
  Quantifier Elimination by Partial Cylindrical Algebraic Decomposition
  ☆26Updated 5 months ago
• meelgroup / ganak
  High-performance model counter
  ☆50Updated this week
• SRI-CSL / libpoly
  SRI LibPoly is a C library for manipulating polynomials
  ☆52Updated 2 weeks ago
• conp-solutions / mergesat
  configurable, high-performance SAT solver, implementing incremental solving interface of MiniSat and IPASIR. Based on MiniSat (minisat.se…
  ☆41Updated 2 years ago
• utwente-fmt / ltsmin
  The LTSmin model checking toolset
  ☆60Updated last year
• fslivovsky / qute
  Qute: a dependency learning QBF solver.
  ☆14Updated 11 months ago
• Bastacyclop / egg-sketches
  sketches for egg: a flexible, high-performance e-graph library
  ☆29Updated 2 months ago
• meelgroup / approxmc
  Approximate Model Counter
  ☆79Updated last month
• ltentrup / caqe
  CAQE is a solver for quantified Boolean formulas
  ☆36Updated 2 years ago
• ths-rwth / smtrat
  ☆58Updated last week
• eprover / PyRes
  Pedagogical first-order prover in Python
  ☆77Updated 5 months ago
• martinjonas / Q3B
  ☆30Updated 2 months ago
• eprover / eprover
  ☆157Updated last week
• cs-au-dk / MONA
  MONA - a decision procedure for monadic second-order logic on finite strings and trees
  ☆54Updated 5 years ago
• marijnheule / CnC
  Cube-and-Conquer SAT solver
  ☆40Updated 4 months ago
• arminbiere / lingeling
  Lingeling SAT Solver
  ☆105Updated last year
• ultimate-pa / smtinterpol
  SMTInterpol interpolating SMT solver
  ☆68Updated 2 weeks ago
• dreal / dreal3
  There is a new version of dReal, available at https://github.com/dreal/dreal4
  ☆50Updated 4 years ago
• neuppl / rsdd
  Performant and safe knowledge compilation in rust
  ☆30Updated 2 weeks ago
• MarkusRabe / cadet
  A fast and certifying solver for quantified Boolean formulas.
  ☆26Updated 7 months ago
• mgudemann / iimc
  ☆14Updated 7 years ago
• MatthiasNickles / diff-SAT
  Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability
  ☆68Updated last year