motib / LearnSATLinks
SAT solver for education
☆26Updated 3 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
- The Standard Interface for Incremental Satisfiability Solving☆50Updated 3 years ago
- Pedagogical first-order prover in Python☆76Updated 4 months ago
- A heuristic procedure for proving inequalities☆34Updated 7 years ago
- Lean4 port of Arduino balance car controller☆47Updated 4 years ago
- λ² is a tool for synthesizing functional programs from input-output examples.☆87Updated 2 years ago
- Deposited packages of the homalg project☆16Updated last month
- An equational theorem prover based on Knuth-Bendix completion☆56Updated last week
- The formal proof of the Odd Order Theorem☆35Updated 2 weeks ago
- An implementation of Hoare and He's Unifying Theories of Programming in Isabelle☆37Updated last year
- The project SPARK Formal aims at developing a complete semantics of the SPARK language in Coq.☆12Updated 4 years ago
- Quantifier Elimination by Partial Cylindrical Algebraic Decomposition☆26Updated 4 months ago
- Repository where I'll collect some demos of proof assistants that I show to various people in order to spread the magic☆38Updated 2 years ago
- The DRAT-trim proof checker☆65Updated 11 months ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated last month
- Code samples for Lean 4☆77Updated 2 years ago
- Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability☆68Updated last year
- An automated theorem prover that uses Büchi automata.☆43Updated 4 years ago
- Tutorial for the CHR system☆16Updated 4 years ago
- Offline partial evaluation system for Prolog written using the cogen approach☆20Updated 9 years ago
- Implementation of books from Bourbaki's Elements of Mathematics in Coq [maintainer=@thery]☆31Updated 4 months ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- A book about functional programming in Lean☆44Updated last year
- An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics☆50Updated last week
- A toolkit for higher-dimensional diagram rewriting.☆17Updated 3 years ago
- ☆11Updated last month
- Educational Proof Assistant for Type Theory☆80Updated last year
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- Monadic Constraint Programming framework☆28Updated 7 years ago
- LPTP: A Logic Program Theorem Prover, written by Robert F. Staerk in the mid 1990's☆14Updated 2 months ago