Alternatives and similar repositories for LearnSAT

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

• bzhan / holpy
  Implementation of higher-order logic in Python
  ☆65Updated 2 years ago
• jfeser / L2
  λ² is a tool for synthesizing functional programs from input-output examples.
  ☆87Updated 2 years ago
• eprover / PyRes
  Pedagogical first-order prover in Python
  ☆77Updated 5 months ago
• Anniepoo / swiplchrtut
  Tutorial for the CHR system
  ☆16Updated 4 years ago
• nfzhou / lp-contest
  ☆11Updated 2 months ago
• MatthiasNickles / diff-SAT
  Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability
  ☆68Updated last year
• leuschel / logen
  Offline partial evaluation system for Prolog written using the cogen approach
  ☆20Updated 9 years ago
• ptarau / TypesAndProofs
  Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems
  ☆34Updated 3 weeks ago
• philzook58 / ad-lens
  Automatic Differentiation using Pseudo Lenses. Neat.
  ☆20Updated 5 years ago
• isabelle-utp / utp-main
  An implementation of Hoare and He's Unifying Theories of Programming in Isabelle
  ☆36Updated last year
• SWI-Prolog / tabled-prolog-book
  Programming in Tabled Prolog by David S Warren
  ☆22Updated 5 years ago
• GaloisInc / lean4-balance-car
  Lean4 port of Arduino balance car controller
  ☆48Updated 4 years ago
• PetterS / qepcad
  Quantifier Elimination by Partial Cylindrical Algebraic Decomposition
  ☆26Updated 5 months ago
• david-a-wheeler / mmverify.py
  Metamath verifier in Python
  ☆40Updated 5 months ago
• homalg-project / homalg_project
  Deposited packages of the homalg project
  ☆16Updated 2 months ago
• jrclogic / SMCDEL
  A symbolic model checker for Dynamic Epistemic Logic.
  ☆49Updated 3 weeks ago
• biotomas / ipasir
  The Standard Interface for Incremental Satisfiability Solving
  ☆50Updated 3 years ago
• math-comp / odd-order
  The formal proof of the Odd Order Theorem
  ☆36Updated 2 weeks ago
• uwplse / potpie
  Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct
  ☆16Updated last year
• maude-lang / Maude
  Language based on Rewriting Logic
  ☆146Updated this week
• maude-team / full-maude
  Automatically exported from code.google.com/p/full-maude
  ☆16Updated 2 months ago
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆57Updated 2 weeks ago
• LS-Lab / KeYmaeraX-release
  KeYmaera X: An aXiomatic Tactical Theorem Prover for Hybrid Systems (release)
  ☆84Updated 4 months ago
• avigad / polya
  A heuristic procedure for proving inequalities
  ☆34Updated 7 years ago
• RBornat / jape
  Jape, a configurable proof editor (best at natural deduction and sequent calculus)
  ☆52Updated last year
• aprolog-lang / aprolog
  αProlog
  ☆18Updated 2 years ago
• webyrd / relational-parsing-with-derivatives
  Relational version of parsing with derivatives code
  ☆43Updated 12 years ago
• AlgebraicJulia / AlgebraicRewriting.jl
  Implementations of algebraic rewriting techniques like DPO, SPO, SqPO.
  ☆32Updated last month
• kirkedal / rfun-interp
  Interpreter for the reversible functional language rFun
  ☆37Updated 7 years ago
• letmaik / monadiccp
  Monadic Constraint Programming framework
  ☆28Updated 7 years ago