Towards Smart Proof Search for Isabelle

01/10/2017
by   Yutaka Nagashima, et al.
0

Despite the recent progress in automatic theorem provers, proof engineers are still suffering from the lack of powerful proof automation. In this position paper we first report our proof strategy language based on a meta-tool approach. Then, we propose an AI-based approach to drastically improve proof automation for Isabelle, while identifying three major challenges we plan to address for this objective.

READ FULL TEXT

page 1

page 2

page 3

research
04/17/2019

Towards Evolutionary Theorem Proving for Isabelle/HOL

Mechanized theorem proving is becoming the basis of reliable systems pro...
research
09/20/2023

Automated Mathematics and the Reconfiguration of Proof and Labor

This essay examines how automation has reconfigured mathematical proof a...
research
06/12/2018

Goal-Oriented Conjecturing for Isabelle/HOL

We present PGT, a Proof Goal Transformer for Isabelle/HOL. Given a proof...
research
10/11/2018

FEther: An Extensible Definitional Interpreter for Smart-contract Verifications in Coq

Blockchain technology adds records to a list using cryptographic links. ...
research
05/15/2019

holpy: Interactive Theorem Proving in Python

The design of modern proof assistants is faced with several sometimes co...
research
04/02/2018

Learning to Reason with HOL4 tactics

Techniques combining machine learning with translation to automated reas...
research
05/06/2022

The Supervisionary proof-checking kernel (or: a work-in-progress towards proof generating code)

Interactive theorem proving software is typically designed around a trus...

Please sign up or login with your details

Forgot password? Click here to reset