We investigate the improvement of theorem provers by reusing previously computed proofs. We formulate our method for reusing proofs as an instance of the problem reduction paradigm and then develop a termination requirement for our reuse procedure. We prove the soundness of our proposal and show that reusability of proofs is not spoiled by the termination requirement imposed on the reuse procedure. We also give evidence for the general usefulness of our termination requirement for lemma speculation in induction theorem proving.
CITATION STYLE
Kolbe, T., & Walther, C. (1996). Termination of theorem proving by reuse. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1104, pp. 106–120). Springer Verlag. https://doi.org/10.1007/3-540-61511-3_72
Mendeley helps you to discover research relevant for your work.