Reusing Proofs

1 We develop a learning component for a theorem prover designed for verifying statements by mathematical induction. If the prover has found a proof, it is analyzed yielding a so-called catch. The catch provides the features of the proof which are relevant for reusing it in subsequent verification tasks and may also suggest useful lemmata. Proof analysis techniques for computing the catch are presented. A catch is generalized in a certain sense for increasing the reusability of proofs. We discuss problems arising when learning from proofs and illustrate our method by several examples.

• Type: Conference
• Year: 1994
• Where: ECAI
• Authors: Thomas Kolbe, Christoph Walther
• Keywords: Artificial Intelligence, ECAI 1994, Proof Analysis Techniques, So-called Catch, Theorem Prover