Towards Machine Learning Mathematical Induction

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

Mathematical 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 MiLkMaId, our approach to suggesting promising applications of mathematical induction without completing a proof search.

READ FULL TEXT

page 1

page 2

page 3

research
12/04/2018

Towards Machine Learning Induction

Induction lies at the heart of mathematics and computer science. However...
research
04/06/2023

A Mathematical Benchmark for Inductive Theorem Provers

We present a benchmark of 29687 problems derived from the On-Line Encycl...
research
06/09/2021

Automating Induction by Reflection

Despite recent advances in automating theorem proving in full first-orde...
research
08/14/2020

Induction Models on ℕ

Mathematical induction is a fundamental tool in computer science and mat...
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
09/24/2013

Automation of Mathematical Induction as part of the History of Logic

We review the history of the automation of mathematical induction...
research
01/27/2020

Smart Induction for Isabelle/HOL (System Description)

Proof assistants offer tactics to facilitate inductive proofs. However, ...

Please sign up or login with your details

Forgot password? Click here to reset