Towards United Reasoning for Automatic Induction in Isabelle/HOL

05/25/2020
by   Yutaka Nagashima, et al.
0

Inductive theorem proving is an important long-standing challenge in computer science. In this extended abstract, we first summarize the recent developments of proof by induction for Isabelle/HOL. Then, we propose united reasoning, a novel approach to further automating inductive theorem proving. Upon success, united reasoning takes the best of three schools of reasoning: deductive reasoning, inductive reasoning, and inductive reasoning, to prove difficult inductive problems automatically.

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
12/04/2018

Towards Machine Learning Mathematical Induction

Mathematical induction lies at the heart of mathematics and computer sci...
research
06/09/2021

Automating Induction by Reflection

Despite recent advances in automating theorem proving in full first-orde...
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
06/16/2019

Self-organized inductive reasoning with NeMuS

Neural Multi-Space (NeMuS) is a weighted multi-space representation for ...
research
08/19/2021

Towards an Automatic Proof of Lamport's Paxos

Lamport's celebrated Paxos consensus protocol is generally viewed as a c...
research
09/07/2021

Conjectures, Tests and Proofs: An Overview of Theory Exploration

A key component of mathematical reasoning is the ability to formulate in...

Please sign up or login with your details

Forgot password? Click here to reset