motib / LearnSATLinks
SAT solver for education
☆26Updated 2 years ago
Alternatives and similar repositories for LearnSAT
Users that are interested in LearnSAT are comparing it to the libraries listed below
Sorting:
- Implementation of higher-order logic in Python☆65Updated 2 years ago
- Deposited packages of the homalg project☆15Updated 3 months ago
- Pedagogical first-order prover in Python☆76Updated 2 months ago
- Lean4 port of Arduino balance car controller☆44Updated 4 years ago
- The Standard Interface for Incremental Satisfiability Solving☆50Updated 3 years ago
- An encyclopedia of proofs☆62Updated 8 months ago
- The formal proof of the Odd Order Theorem☆31Updated last month
- A heuristic procedure for proving inequalities☆33Updated 6 years ago
- Metamath verifier in Python☆40Updated 2 months ago
- λ² is a tool for synthesizing functional programs from input-output examples.☆69Updated 2 years ago
- An equational theorem prover based on Knuth-Bendix completion☆52Updated last month
- Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability☆66Updated last year
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- An implementation of Hoare and He's Unifying Theories of Programming in Isabelle☆37Updated last year
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- The DRAT-trim proof checker☆63Updated 8 months ago
- Source of metamath book☆49Updated last year
- A symbolic model checker for Dynamic Epistemic Logic.☆46Updated 2 weeks ago
- Quantifier Elimination by Partial Cylindrical Algebraic Decomposition☆26Updated 2 months ago
- DepQBF, a solver for quantified boolean formulae (QBF).☆36Updated 2 years ago
- ☆23Updated 3 years ago
- Tutorial for the CHR system☆16Updated 4 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆50Updated 9 months ago
- An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics☆49Updated last month
- An automated theorem prover that uses Büchi automata.☆42Updated 3 years ago
- αProlog☆18Updated 2 years ago
- Monadic Constraint Programming framework☆28Updated 7 years ago
- Language based on Rewriting Logic☆127Updated last week
- An automatic theorem prover for first order logic with equality☆31Updated 5 years ago
- A formal proof of the irrationality of zeta(3), the Apéry constant [maintainer=@amahboubi,@pi8027]☆24Updated last month