Goal-Oriented Conjecturing for Isabelle/HOL

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

We present PGT, a Proof Goal Transformer for Isabelle/HOL. Given a proof goal and its background context, PGT attempts to generate conjectures from the original goal by transforming the original proof goal. These conjectures should be weak enough to be provable by automation but sufficiently strong to identify and prove the original goal. By incorporating PGT into the pre-existing PSL framework, we exploit Isabelle's strong automation to identify and prove such conjectures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2023

Automated Mathematics and the Reconfiguration of Proof and Labor

This essay examines how automation has reconfigured mathematical proof a...
research
01/10/2017

Towards Smart Proof Search for Isabelle

Despite the recent progress in automatic theorem provers, proof engineer...
research
04/02/2018

Learning to Reason with HOL4 tactics

Techniques combining machine learning with translation to automated reas...
research
03/20/2020

Tactic Learning and Proving for the Coq Proof Assistant

We present a system that utilizes machine learning for tactic proof sear...
research
01/24/2020

Up-to Techniques for Branching Bisimilarity

Ever since the introduction of behavioral equivalences on processes one ...
research
05/27/2011

Cooperation between Top-Down and Bottom-Up Theorem Provers

Top-down and bottom-up theorem proving approaches each have specific adv...
research
07/31/2020

The Tactician (extended version): A Seamless, Interactive Tactic Learner and Prover for Coq

We present Tactician, a tactic learner and prover for the Coq Proof Assi...

Please sign up or login with your details

Forgot password? Click here to reset