Automated theorem proving
Subfield of automated reasoning and mathematical logic
Follow Automated theorem proving on Notably News to receive short updates to your email — rarely!
We include updates on Boolean satisfiability problem, Wolfram Mathematica, SAT solver, Satisfiability modulo theories, DPLL algorithm, Proof assistant, Sequent calculus, Logic Theorist, 2-satisfiability, Hilbert system, Computer-assisted proof, Method of analytic tableaux, True quantified Boolean formula, Conflict-driven clause learning, Burrows–Abadi–Needham logic, Occurs check ... and more.
2024 |
Lean
Google DeepMind created AlphaProof, an AI system capable of proving mathematical statements in Lean at the level of a silver medalist at the International Mathematical Olympiad, marking the first AI system to achieve such a performance.
|
2023 |
Lean
Terence Tao used Lean to formalize a proof of the Polynomial Freiman-Ruzsa (PFR) conjecture, which he and collaborators had published in the same year.
|
2023 |
Lean
Formation of the Lean FRO (Formal Reasoning Organization) with objectives to improve the language's scalability, usability, and implement proof automation.
|
2023 |
Lean
Vlad Tenev and Tudor Achim co-founded Harmonic, a startup aimed at reducing AI hallucinations by generating and checking Lean code.
|
2022 |
Lean
OpenAI and Meta AI independently created AI models capable of generating proofs for high-school-level olympiad problems using the Lean proof assistant. Meta AI made their model publicly available in the Lean environment.
|
April 2022 |
Satisfiability modulo theories
cvc5 solver released version 1.0, offering expanded support for various computational theories and programming language interfaces.
|
April 2 2022 |
F*
F* drops its previous bootstrapping approach, marking a significant change in the language's development strategy.
|
March 24 2022 |
F*
F* programming language completes its last version where it was written entirely in a common subset of F* and F#, supporting bootstrapping in both OCaml and F#.
|
2021 |
Lean
A team of researchers used Lean to verify the correctness of a mathematical proof by Peter Scholze in the field of condensed mathematics, gaining significant attention for formalizing a cutting-edge mathematical research result.
|
2021 |
Lean
Release of Lean 4, a reimplementation of the Lean theorem prover with enhanced capabilities including C code production, improved macro system, type class synthesis, and memory management.
|
May 2021 |
Satisfiability modulo theories
CVC4 solver released version 1.8, supporting advanced theories and multiple platforms.
|
2017 |
Lean
The community-maintained mathlib project began, aiming to digitize pure mathematics by creating a comprehensive library for the Lean proof assistant. The project's goal was to develop an extensive mathematical library covering research-level mathematics.
|
January 20 2017 |
Lean
First release of Lean 3, which was the first moderately stable version of the proof assistant, implemented primarily in C++ with some features written in Lean itself.
|
2014 |
Satisfiability modulo theories
raSAT solver was developed, extending Interval Constraint Propagation with Testing and the Intermediate Value Theorem.
|
2013 |
Lean
Leonardo de Moura launches Lean at Microsoft Research, introducing the initial experimental versions of the proof assistant (later known as Lean 1 and 2).
|
2012 |
Satisfiability modulo theories
SMTInterpol solver was developed, focusing on generating high-quality, compact interpolants.
|
2011 |
Satisfiability modulo theories
OpenSMT, a lazy SMT solver, was introduced. STP solver became active, supporting multiple programming languages. Z3 Theorem Prover participated in SMT-COMP.
|
2010 |
Satisfiability modulo theories
CVC3 solver was active, capable of producing proof output to HOL. MathSAT solver was also developed, supporting multiple theories and programming languages.
|
This contents of the box above is based on material from the Wikipedia articles Satisfiability modulo theories, F* (programming language) & Lean (proof assistant), which are released under the Creative Commons Attribution-ShareAlike 4.0 International License.