Name
Abstract | ||
|---|---|---|
The ability to automatically generalise (interactive) proofs and use such generalisations to discharge related conjectures is a very hard problem which remains unsolved. Here, we develop a notion of goal types to capture key properties of goals, which enables abstractions over the specific order and number of sub-goals arising when composing tactics. We show that the goal types form a lattice, and utilise this property in the techniques we develop to automatically generalise proof strategies in order to reuse it for proofs of related conjectures. We illustrate our approach with an example. |
Year | Venue | Field |
|---|---|---|
2013 | CoRR | Discrete mathematics,Abstraction,Generalization,Computer science,Reuse,Algorithm,Mathematical proof |
DocType | Volume | Citations |
Journal | abs/1303.2975 | 2 |
PageRank | References | Authors |
0.46 | 10 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gudmund Grov | 1 | 100 | 17.38 |
| Ewen Maclean | 2 | 38 | 4.77 |