Alternatives and similar repositories for obst

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

• eprover / PyRes
  Pedagogical first-order prover in Python
  ☆77Updated 5 months ago
• fslivovsky / qute
  Qute: a dependency learning QBF solver.
  ☆14Updated 11 months ago
• biotomas / ipasir
  The Standard Interface for Incremental Satisfiability Solving
  ☆50Updated 3 years ago
• lonsing / depqbf
  DepQBF, a solver for quantified boolean formulae (QBF).
  ☆39Updated 2 years ago
• meelgroup / ganak
  High-performance model counter
  ☆50Updated 2 weeks ago
• daajoe / GPUSAT
  ☆11Updated 4 years ago
• MatthiasNickles / diff-SAT
  Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability
  ☆68Updated last year
• avigad / polya
  A heuristic procedure for proving inequalities
  ☆34Updated 7 years ago
• maude-lang / Maude
  Language based on Rewriting Logic
  ☆146Updated this week
• ReedOei / Pecan
  An automated theorem prover that uses Büchi automata.
  ☆43Updated 4 years ago
• alpha-asp / Alpha
  A lazy-grounding Answer-Set Programming system
  ☆62Updated 2 weeks ago
• owl-toolkit / owl
  ☆20Updated 2 years ago
• jfeser / L2
  λ² is a tool for synthesizing functional programs from input-output examples.
  ☆87Updated 2 years ago
• ai4reason / Prover9
  Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.
  ☆55Updated last year
• leoprover / Leo-III
  An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics
  ☆49Updated last month
• UCSD-PL / proverbot9001
  ☆43Updated this week
• reactive-systems / bosy
  BoSy is a reactive synthesis tool based on constraint-solving
  ☆19Updated 2 years ago
• utwente-fmt / ltsmin
  The LTSmin model checking toolset
  ☆60Updated last year
• leuschel / logen
  Offline partial evaluation system for Prolog written using the cogen approach
  ☆20Updated 9 years 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
• nicolasprevot / GpuShareSat
  Source code for GpuShareSat, a library for SAT solvers to use the GPU for clause sharing between CPU threads.
  ☆34Updated 4 years ago
• potassco / clasp
  ⚙️ A conflict-driven nogood learning answer set solver
  ☆130Updated last week
• probing-lab / polar
  ☆17Updated 7 months ago
• utwente-fmt / sylvan
  Multi-core Decision Diagram (BDD/LDD) implementation
  ☆43Updated 2 years ago
• meyerphi / strix
  Strix is a tool for reactive synthesis of controllers from LTL specifications.
  ☆23Updated 3 years ago
• marijnheule / drat-trim
  The DRAT-trim proof checker
  ☆67Updated 11 months ago
• piantado / enumerateCFG
  Code for enumeration from a CFG
  ☆20Updated 2 years ago
• TyGuS / suslik
  Synthesis of Heap-Manipulating Programs from Separation Logic
  ☆128Updated 2 years ago
• bzhan / holpy
  Implementation of higher-order logic in Python
  ☆65Updated 2 years ago
• isabelle-utp / utp-main
  An implementation of Hoare and He's Unifying Theories of Programming in Isabelle
  ☆36Updated last year