Resolution theorem proving for predicate logic in pure Python.
-
Updated
Jan 7, 2020 - Python
#
prover
Here are 16 public repositories matching this topic...
An automatic theorem prover in OCaml for typed higher-order logic with equality, datatypes and arithmetic, based on superposition+rewriting; and Logtk, a supporting library for manipulating terms, formulas, clauses, etc.
prototype
experimental
ocaml
computer-science-algorithms
logic
polymorphism
cnf
superposition
saturation
induction
symbolic-computation
prover
rewriting
-
Updated
Jul 22, 2020 - OCaml
[research] A modular SMT solver in OCaml, based on mcSAT
-
Updated
Mar 10, 2020 - SMT
[wip] A modular library for CDCL(T) SMT solvers, with proof generation.
-
Updated
May 28, 2020 - SMT
resolution based prover finding all proofs
-
Updated
Jul 20, 2020 - Julia
An implementation of a propositional logic resolution prover in Rust.
-
Updated
Aug 19, 2018 - Rust
Haskell interface to automated theorem provers
haskell
logic
theorem-proving
first-order-logic
formal-methods
tptp
atp
prover
automated-theorem-provers
-
Updated
Jun 4, 2020 - Haskell
A kernel using inference rules in order to compute the three of proves.
-
Updated
Oct 9, 2017 - OCaml
an ACL2 style theorem prover with structural diff, embedded in scheme.
-
Updated
Mar 17, 2019 - Scheme
A Simple Prover written in Common Lisp, based on clause resolution
common-lisp
logic
theorem-proving
proof-assistant
logic-programming
symbolic-computation
prover
theorem-prover
refutation-tree
-
Updated
Oct 28, 2018 - Common Lisp
Improve this page
Add a description, image, and links to the prover topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the prover topic, visit your repo's landing page and select "manage topics."