Machine Learning for Inductive Theorem Proving

@inproceedings{Jiang2018MachineLF,
  title={Machine Learning for Inductive Theorem Proving},
  author={Yaqing Jiang and P. Papapanagiotou and Jacques D. Fleuriot},
  booktitle={AISC},
  year={2018}
}
Over the past few years, machine learning has been successfully combined with automated theorem provers to prove conjectures from proof assistants. However, such approaches do not usually focus on inductive proofs. In this work, we explore a combination of machine learning, a simple Boyer-Moore model and ATPs as a means of improving the automation of inductive proofs in the proof assistant HOL Light. We evaluate the framework using a number of inductive proof corpora. In each case, our approach… 
Lemma Synthesis for Automating Induction over Algebraic Data Types
TLDR
An automated prover is presented that searches for a sequence of simplifications and transformations to prove the validity of a given theorem, and in the absence of required lemmas, attempts to synthesize supporting lemma based on terms and expressions witnessed during the search for a proof.
Domain-Specific Language to Encode Induction Heuristics
Proof assistants, such as Isabelle/HOL, offer tools to facilitate inductive theorem proving. Isabelle experts know how to use these tools effectively; however, they did not have a systematic way to
Why Machines Don’t (yet) Reason Like People
TLDR
This paper traces their limitations back to two historical developments in AI: the motivation to establish automated theorem-provers for systems of mathematical logic, and the formulation of nonmonotonic systems of reasoning.
A I ] 3 D ec 2 01 9 Self-Learned Formula Synthesis in Set Theory ∗
TLDR
This work applies machine learning to the task of synthesizing formulas satisfying a collection of semantic properties and instantiation of set variables requiring induction.
Smart Induction for Isabelle/HOL (Tool Paper)
  • Yutaka Nagashima
  • Computer Science
    2020 Formal Methods in Computer Aided Design (FMCAD)
  • 2020
TLDR
This work presents smart_induct, an interactive tool that lists promising arguments for the induct tactic without relying on a search that can be used to narrow the search space of automatic inductive provers.
LiFtEr: Language to Encode Induction Heuristics for Isabelle/HOL
Proof assistants, such as Isabelle/HOL, offer tools to facilitate inductive theorem proving. Isabelle experts know how to use these tools effectively; however they did not have a systematic way to
SeLFiE: Modular Semantic Reasoning for Induction in Isabelle/HOL
TLDR
SeLFiE, a domain-specific language to encode experienced users' expertise on how to apply the induct tactic in Isabelle/HOL, facilitates the intricate interaction between syntactic and semantic analyses using semantic constructs while maintaining the modularity of each analysis.
Faster Smarter Induction in Isabelle/HOL with SeLFiE
TLDR
SeLFiE, a domain-specific language to encode experienced users' expertise on how to apply the induct tactic in Isabelle/HOL is presented, and semantic_induct, an automatic tool to recommend how to applied the induction tactic is presented.
Smart Induction for Isabelle/HOL (System Description)
TLDR
This work presents smart_induct, a system that lists promising arguments for the induct tactic without relying on a search to solve an inductive problem in any problem domain.
A Blockchain-Based Approach for Collaborative Formalization of Mathematics and Programs
TLDR
This paper demonstrates a blockchain-based system for collaborative formalization of mathematics and programs incorporating both human labour as well as AI tools, and shows how formalized proofs of different sorting algorithms can be produced collaboratively in this proposed blockchain system.
...
1
2
...

References

SHOWING 1-10 OF 88 REFERENCES
Proof output and machine learning for inductive theorem provers
TLDR
HipSpec is an inductive theorem prover that has not yet explored this area, and a foundation for supporting machine learning implementations within HipSpec is laid, which allows HipSpec to remember already-proven theorems in between executions.
Learning-Assisted Automated Reasoning with Flyspeck
TLDR
It is shown that 39 % of the 14185 theorems could be proved in a push-button mode (without any high-level advice and user interaction) in 30 seconds of real time on a fourteen-CPU workstation.
Productive use of failure in inductive proof
TLDR
It is shown how the failure if rippling can be used in bridging gaps in the search for inductive proofs, and a novel theorem-proving architecture for supporting the automatic discovery of eureka steps is presented.
Automating Inductive Proofs Using Theory Exploration
TLDR
HipSpec automatically generates a set of equational theorems about the available recursive functions of a program that make up an algebraic specification for the program and can in addition be used as a background theory for proving additional user-stated properties.
Automated and Human Proofs in General Mathematics: An Initial Comparison
TLDR
This paper describes an initial experiment and comparison conducted over the 50000 mathematical theorems from the Mizar Mathematical Library, providing enough data for an initial comparison of the proofs written by mathematicians and the proofs found automatically.
The Use of Explicit Plans to Guide Inductive Proofs
  • A. Bundy
  • Computer Science, Mathematics
    CADE
  • 1988
We propose the use of explicit proof plans to guide the search for a proof in automatic theorem proving. By representing proof plans as the specifications of LCF-like tactics, [Gordon et al 79], and
Hammering towards QED
This paper surveys the emerging methods to automate reasoning over large libraries developed with formal proof assistants. We call these methods hammers. They give the authors of formal proofs a
Superposition with Structural Induction
TLDR
This work presents a new extension of typed superposition that can perform structural induction, and describes an implementation and presents some promising results.
Learning to Prove with Tactics
TLDR
A automated tactical prover TacticToe is implemented on top of the HOL4 interactive theorem prover, which learns from human proofs which mathematical technique is suitable in each proof situation and uses this knowledge in a Monte Carlo tree search algorithm to explore promising tactic-level proof paths.
Lightweight relevance filtering for machine-generated resolution problems
...
1
2
3
4
5
...