Abstract
We investigate the improvement of theorem provers by reusing previously computed proofs, cf. (Kolbe and Walther, 1994; Kolbe and Walther, 1995d; Kolbe and Walther, 1996a; Kolbe and Walther, 1996b; Kolbe and Walther, 1997). Our work has similarities with the machine learning methodologies of explanation-based learning (Ellman, 1989), analogical reasoning (Hall, 1989), and abstraction (Giunchiglia and Walsh, 1992).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bates, J. L. and R. L. Constable: 1985, ‘Proofs as Programs’. ACM Transactions on Programming Languages and Systems 7 (1), 113–136.
Dershowitz, N. and Z. Manna: 1979, `Proving Termination with Multiset Orderings’. Communications of the ACM 22(8), 465–476.
Ellman, T.: 1989, ‘Explanation-Based Learning: A Survey of Programs and Perspectives’. ACM Computing Surveys 21 (2), 163–221.
Etzioni, O.: 1993, ‘A Structural Theory of Explanation-Based Learning’. Artificial Intelligence 60, 93–139.
Giunchiglia, F. and T. Walsh: 1992, `A Theory of Abstraction’. Artificial Intelligence 57, 323–389.
Hall, R. P.: 1989, ‘Computational Approaches to Analogical Reasoning: A Comparative Analysis’. Artificial Intelligence 39, 39–120.
Holder, L. B.: 1992, ‘Empirical Analysis of the General Utility Problem in Machine Learning’. In: Proceedings AAAI-92.
Huang, X.: 1994, ‘PROVERB: A System Explanining Machine-Found Proofs’. In: Proc. of 16th Annual Conf of the Cognitive Science Society. Atlanta, Georgia.
Huet, G. and B. Lang: 1978, ‘Proving and Applying Program Transformations Expressed with Second-Order Patterns’. Acta Informatica 11, 31–55.
Kolbe, T.: 1997, ‘Optimizing Proof Search by Machine Learning Techniques’. Ph.D. thesis, Technische Hochschule Darmstadt.
Kolbe, T. and J. Brauburger: 1997, ‘PLAGIATOR - A Learning Prover’. In: W. McCune (ed.): Proceedings of the 14th International Conference on Automated Deduction (CADE-97), Townsville, Australia. pp. 256–259, Springer.
Kolbe, T. and C. Walther: 1994, ‘Reusing Proofs’. In: A. Cohn (ed.): Proceedings of the 11th European Conference on Artificial Intelligence (ECAI-94), Amsterdam, The Netherlands. John Wiley & Sons, Ltd., pp. 80–84.
Kolbe, T. and C. Walther: 1995a, ‘Adaptation of Proofs for Reuse’. In: D. W. Aha and A. Ram (eds.): Adaptation of Knowledge for Reuse. Papers from the 1995 AAAI Fall Symposium, Cambridge, MA, USA. pp. 61–67, The AAAI Press.
Kolbe, T. and C. Walther: 1995b, ‘Patching Proofs for Reuse’. In: N. Lavrac and S. Wrobel (eds.): Proceedings of the European Conference on Machine Learning (ECML-95), Heraklion, Greece. pp. 303–306, Springer LNAI 912.
Kolbe, T. and C. Walther: 1995c, ‘Proof Management and Retrieval’. In: Proceedings of the IJCAI’95 Workshop on Formal Approaches to the Reuse of Plans, Proofs, and Programs. pp. 16–20.
Kolbe, T. and C. Walther: 1995d, ‘Second-Order Matching modulo Evaluation — A Technique for Reusing Proofs’. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), Montreal, Canada. pp. 190–195.
Kolbe, T. and C. Walther: 1996a, ‘Proving Theorems by Mimicking a Human’s Skill’. In: Y. Gil (ed.): Acquisition, Learning & Demonstration: Automating Tasks for Users. 1996 AAAI Spring Symposium,Menlo Park, CA, USA. pp. 50–56.
Kolbe, T. and C. Walther: 1996b, ‘Termination of Theorem Proving by Reuse’. In: M. McRobbie and J. Slaney (eds.): Proceedings of the 13th International Conference on Automated Deduction (CADE-96), New Brunswick, NJ, USA. pp. 106–120.
Kolbe, T. and C. Walther: 1997, ‘Proving Theorems by Reuse’. Research Report IBN 97/52, TU Darmstadt.
Kolbe, T. and C. Walther: 1998, ‘On Terminating Lemma Speculations’. Journal Information and Computation. (to appear).
Melis, E. and J. Whittle: 1998, ‘Analogy in Inductive Theorem Proving’. Journal of Automated Reasoning 20 (3). To appear.
Minton, S.: 1990, ‘Quantitative Results Concerning the Utility of Explanation-Based Learning’. Artificial Intelligence 42, 363–391.
Nilsson, N. J.: 1971, Problem Solving Methods in Artificial Intelligence. McGraw Hill, New York.
Segre, A. and C. Elkan: 1994, ‘A High-Performance Explanation-Based Learning Algorithm’. Artificial Intelligence 69, 1–50.
Smyth, B. and M. T. Keane: 1995, ‘Remembering to Forget’. In: Proc. 14th Intern. Joint Conf. on Artif. Intell. (IJCAI-95). Morgan Kaufmann, pp. 377–382.
Walther, C.: 1994, ‘Mathematical Induction’. In: D. M. Gabbay, C. J. Hogger, and J. A. Robinson (eds.): Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 2. Oxford University Press, pp. 127–227.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Kolbe, T., Walther, C. (1998). Proof Analysis, Generalization and Reuse. In: Bibel, W., Schmitt, P.H. (eds) Automated Deduction — A Basis for Applications. Applied Logic Series, vol 9. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0435-9_8
Download citation
DOI: https://doi.org/10.1007/978-94-017-0435-9_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5051-9
Online ISBN: 978-94-017-0435-9
eBook Packages: Springer Book Archive