We describe an approach to automatically invent/explore new mathematical theories, with the goal of producing results comparable to those produced by humans, as represented, for example, in the libraries of the Isabelle proof assistant. Our approach is based on ‘schemes’, which are terms in higher-order logic. We show that it is possible to automate the instantiation process of schemes to generate conjectures and definitions. We also show how the new definitions and the lemmata discovered during the exploration of the theory can be used not only to help with the proof obligations during the exploration, but also to reduce redundancies inherent in most theory formation systems. We implemented our ideas in an automated tool, called IsaScheme,...
We present a method for example-guided synthesis of higher-order functional pro- grams. Given a set ...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
Over the past few years, machine learning has been successfully combined with automated theorem pro...
In this thesis we describe an approach to automatically invent/explore new mathematical theories, w...
We have developed a program for inductive theory formation, called IsaCoSy, which synthesises conjec...
We have implemented a program for inductive theory formation, called IsaCoSy, which synthesises conj...
Abstract. In this paper we discuss the similarities between program specialisation and inductive the...
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to gu...
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging proble...
In this thesis we deal with the problem of automatic proving (or disproving) mathematical conjecture...
In this paper we discuss the similarities between program specialisation and inductive theorem provi...
Projet EURECAProofs by induction are important in many computer science and artifical intelligence a...
AbstractAn innovative attempt to develop formal techniques of specification, proof, and program extr...
Theory exploration is a technique for automatically discovering new interesting lemmas in a mathemat...
A key problem in automating proof by mathematical induction is choosing an induction rule suitable f...
We present a method for example-guided synthesis of higher-order functional pro- grams. Given a set ...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
Over the past few years, machine learning has been successfully combined with automated theorem pro...
In this thesis we describe an approach to automatically invent/explore new mathematical theories, w...
We have developed a program for inductive theory formation, called IsaCoSy, which synthesises conjec...
We have implemented a program for inductive theory formation, called IsaCoSy, which synthesises conj...
Abstract. In this paper we discuss the similarities between program specialisation and inductive the...
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to gu...
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging proble...
In this thesis we deal with the problem of automatic proving (or disproving) mathematical conjecture...
In this paper we discuss the similarities between program specialisation and inductive theorem provi...
Projet EURECAProofs by induction are important in many computer science and artifical intelligence a...
AbstractAn innovative attempt to develop formal techniques of specification, proof, and program extr...
Theory exploration is a technique for automatically discovering new interesting lemmas in a mathemat...
A key problem in automating proof by mathematical induction is choosing an induction rule suitable f...
We present a method for example-guided synthesis of higher-order functional pro- grams. Given a set ...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
Over the past few years, machine learning has been successfully combined with automated theorem pro...