Alternatives and similar repositories for Leo-III

Users that are interested in Leo-III are comparing it to the libraries listed below

• eprover / PyRes
  Pedagogical first-order prover in Python
  ☆77Updated 6 months ago
• eprover / eprover
  ☆158Updated 2 weeks ago
• LS-Lab / KeYmaeraX-release
  KeYmaera X: An aXiomatic Tactical Theorem Prover for Hybrid Systems (release)
  ☆85Updated last week
• bzhan / holpy
  Implementation of higher-order logic in Python
  ☆65Updated 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
• ReedOei / Pecan
  An automated theorem prover that uses Büchi automata.
  ☆43Updated 4 years ago
• UniFormal / MMT
  The MMT Language and System
  ☆77Updated 3 months ago
• avigad / polya
  A heuristic procedure for proving inequalities
  ☆34Updated 7 years ago
• medovina / natty
  Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…
  ☆38Updated this week
• digama0 / mm-lean4
  Lean 4 Metamath verifier
  ☆21Updated 6 months ago
• alpha-asp / Alpha
  A lazy-grounding Answer-Set Programming system
  ☆62Updated 2 weeks ago
• isabelle-prover / proving-contest-backends
  "proving-contest"-backends for several theorem provers
  ☆13Updated last year
• avigad / lamr
  Logic and Mechanized Reasoning
  ☆114Updated last month
• friguzzi / aleph
  Port of Aleph to SWI-Prolog
  ☆51Updated last year
• leanprover / leansat
  This package provides an interface and foundation for verified SAT reasoning
  ☆55Updated last year
• IBM / FormalML
  Formalization of Machine Learning Theory with Applications to Program Synthesis
  ☆78Updated last month
• namin / holey
  Python library for program synthesis and symbolic execution combining constraint solving and LLMs
  ☆31Updated this week
• dwhalen / holophrasm
  Holophrasm: a neural Automated Theorem Prover for higher-order logic
  ☆56Updated 5 years ago
• sneeuwballen / zipperposition
  An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logt…
  ☆151Updated last year
• jfeser / L2
  λ² is a tool for synthesizing functional programs from input-output examples.
  ☆87Updated 2 years ago
• bzhan / auto2
  A best-first-search theorem prover implemented in Isabelle
  ☆35Updated 3 years ago
• andrew-bedford / coqatoo
  Generates natural language versions of Coq proofs
  ☆51Updated 7 years ago
• gapt / gapt
  GAPT: General Architecture for Proof Theory
  ☆105Updated last month
• maude-lang / Maude
  Language based on Rewriting Logic
  ☆151Updated last week
• minchaowu / ModalTab
  Verified decision procedures for modal logics in Lean
  ☆12Updated 5 years ago
• jaalonso / Lecturas_GLC
  Readings on computational logic, interactive theorem proving and functional programming.
  ☆84Updated this week
• siddhartha-gadgil / Saturn
  Experiments with SAT solvers with proofs in Lean 4
  ☆62Updated last year
• david-a-wheeler / mmverify.py
  Metamath verifier in Python
  ☆40Updated 6 months ago
• KestrelInstitute / Specware
  Specware consists of a formal specification language and tools for transformation and refinement to efficient implementations in CommonLi…
  ☆24Updated 3 years ago
• gebner / hott3
  HoTT in Lean 3
  ☆82Updated 5 years ago