Proving theorems by reuse

作者:

摘要

We investigate the improvement of theorem proving by reusing previously computed proofs. We have developed and implemented the Plagiator system which proves theorems by mathematical induction with the aid of a human advisor: If a base or step formula is submitted to the system, it tries to reuse a proof of a previously verified formula. If successful, labour is saved, because the number of required user interactions is decreased. Otherwise the human advisor is called for providing a hand crafted proof for such a formula, which subsequently—after some (automated) preparation steps—is stored in the system's memory, to be in stock for future reasoning problems. Besides the potential savings of resources, the performance of the overall system is improved, because necessary lemmata might be speculated as the result of an attempt to reuse a proof. The success of the approach is based on our techniques for preparing given proofs as well as by our methods for retrieval and adaptation of reuse candidates which are promising for future proof reuses. We prove the soundness of our approach and illustrate its performance with several examples.

论文关键词:Deduction and theorem proving,Machine learning,Problem solving and search,Knowledge representation,Analogy,Abstraction,Reuse

论文评审过程:Received 22 October 1997, Revised 7 June 1999, Available online 2 August 2000.

论文官网地址:https://doi.org/10.1016/S0004-3702(99)00096-X