DeepAI AI Chat
Log In Sign Up

Goal-Oriented Conjecturing for Isabelle/HOL

by   Yutaka Nagashima, et al.
Leopold Franzens Universität Innsbruck

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.


page 1

page 2

page 3

page 4


Towards Smart Proof Search for Isabelle

Despite the recent progress in automatic theorem provers, proof engineer...

Learning to Reason with HOL4 tactics

Techniques combining machine learning with translation to automated reas...

A Proof Tree Builder for Sequent Calculus and Hoare Logic

We have developed a web-based pedagogical proof assistant, the Proof Tre...

Tactic Learning and Proving for the Coq Proof Assistant

We present a system that utilizes machine learning for tactic proof sear...

Up-to Techniques for Branching Bisimilarity

Ever since the introduction of behavioral equivalences on processes one ...

Cooperation between Top-Down and Bottom-Up Theorem Provers

Top-down and bottom-up theorem proving approaches each have specific adv...

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...