Towards Machine Learning Induction

12/04/2018
by   Yutaka Nagashima, et al.
0

Induction lies at the heart of mathematics and computer science. However, automated theorem proving of inductive problems is still limited in its power. In this abstract, we first summarize our progress in automating inductive theorem proving for Isabelle/HOL. Then, we present MeLoId, our approach to suggesting promising applications of induction without completing a proof search.

READ FULL TEXT
research
12/04/2018

Towards Machine Learning Mathematical Induction

Mathematical induction lies at the heart of mathematics and computer sci...
research
05/25/2020

Towards United Reasoning for Automatic Induction in Isabelle/HOL

Inductive theorem proving is an important long-standing challenge in com...
research
05/17/2021

Induction and Skolemization in saturation theorem proving

We consider a typical integration of induction in saturation-based theor...
research
09/30/2019

On Herbrand Skeletons

Herbrand's theorem plays an important role both in proof theory and in c...
research
11/20/2022

Template-Based Conjecturing for Automated Induction in Isabelle/HOL

Proof by induction plays a central role in formal verification. However,...
research
10/09/2019

Clause Set Cycles and Induction

In this article we relate a family of methods for automated inductive th...
research
09/19/2020

Faster Smarter Induction in Isabelle/HOL

We present semantic_induct, an automatic tool to recommend how to apply ...

Please sign up or login with your details

Forgot password? Click here to reset