Tinker, tailor, solver, proof
Logic in Computer Science
2014-10-31 v1 Human-Computer Interaction
Abstract
We introduce Tinker, a tool for designing and evaluating proof strategies based on proof-strategy graphs, a formalism previously introduced by the authors. We represent proof strategies as open-graphs, which are directed graphs with additional input/output edges. Tactics appear as nodes in a graph, and can be `piped' together by adding edges between them. Goals are added to the input edges of such a graph, and flow through the graph as the strategy is evaluated. Properties of the edges ensure that only the right `type' of goals are accepted. In this paper, we detail the Tinker tool and show how it can be integrated with two different theorem provers: Isabelle and ProofPower.
Keywords
Cite
@article{arxiv.1410.8217,
title = {Tinker, tailor, solver, proof},
author = {Gudmund Grov and Aleks Kissinger and Yuhui Lin},
journal= {arXiv preprint arXiv:1410.8217},
year = {2014}
}
Comments
In Proceedings UITP 2014, arXiv:1410.7850