Alternatives and similar repositories for minicard

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

• 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
• liffiton / PyMiniSolvers
  A Python API for the MiniSat and MiniCard constraint solvers.
  ☆22Updated 6 months ago
• dreal / dreal3
  There is a new version of dReal, available at https://github.com/dreal/dreal4
  ☆50Updated 4 years ago
• biotomas / ipasir
  The Standard Interface for Incremental Satisfiability Solving
  ☆50Updated 3 years ago
• VeraLiconaResearchGroup / MHSGenerationAlgorithms
  ☆16Updated last year
• lonsing / depqbf
  DepQBF, a solver for quantified boolean formulae (QBF).
  ☆39Updated 2 years ago
• avigad / polya
  A heuristic procedure for proving inequalities
  ☆34Updated 7 years ago
• MatthiasNickles / diff-SAT
  Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability
  ☆69Updated last year
• ondrik / libvata
  VATA Tree Automata Library
  ☆34Updated last year
• sat-group / open-wbo
  Open-WBO: state-of-the-art MaxSAT and Pseudo-Boolean solver
  ☆77Updated 2 years ago
• sdiehl / pyrewrite
  Python term rewriting
  ☆30Updated 12 years ago
• PetterS / qepcad
  Quantifier Elimination by Partial Cylindrical Algebraic Decomposition
  ☆26Updated 6 months ago
• marijnheule / drat-trim
  The DRAT-trim proof checker
  ☆68Updated last year
• MassimoLauria / cnfgen
  CNF generator in DIMACS format. It produces common families of CNFs.
  ☆70Updated 4 months ago
• LS-Lab / KeYmaeraX-release
  KeYmaera X: An aXiomatic Tactical Theorem Prover for Hybrid Systems (release)
  ☆86Updated last month
• eprover / PyRes
  Pedagogical first-order prover in Python
  ☆78Updated 6 months ago
• rishabhs / sygus-comp14
  ☆41Updated 6 years ago
• alexander-nadel / intel_sat_solver
  This repository contains the code of Intel(R) SAT Solver (IntelSAT)
  ☆36Updated 9 months ago
• jfeser / L2
  λ² is a tool for synthesizing functional programs from input-output examples.
  ☆87Updated 2 years ago
• adrianopolus / probSAT
  The probSAT SAT Solver
  ☆26Updated 3 years ago
• meelgroup / ganak
  High-performance model counter
  ☆50Updated 2 weeks ago
• arminbiere / satch
  SAT Solver SATCH
  ☆120Updated 3 years ago
• cs-au-dk / MONA
  MONA - a decision procedure for monadic second-order logic on finite strings and trees
  ☆55Updated 5 years ago
• marijnheule / CnC
  Cube-and-Conquer SAT solver
  ☆42Updated 5 months ago
• dtompkins / ubcsat
  The Stochastic Local Search SAT Solver from UBC
  ☆32Updated 3 years ago
• OKullmann / oklibrary
  A research platform and active library for generalised SAT solving
  ☆33Updated 6 months ago
• netom / satispy
  An interface to SAT solver tools (like minisat)
  ☆62Updated 3 weeks ago
• bzhan / holpy
  Implementation of higher-order logic in Python
  ☆66Updated 2 years ago
• probcomp / Venturecxx
  Primary implementation of the Venture probabilistic programming system
  ☆28Updated 6 years ago
• utwente-fmt / ltsmin
  The LTSmin model checking toolset
  ☆60Updated last year