Abstract
Mechanised reasoning systems and computer algebra systems have apparently different objectives. Their integration is, however, highly desirable, since in many formal proofs both of the two different tasks, proving and calculating, have to be performed. In the context of producing reliable proofs, the question how to ensure correctness when integrating a computer algebra system into a mechanised reasoning system is crucial. In this contribution, we discuss the correctness problems that arise from such an integration and advocate an approach in which the calculations of the computer algebra system are checked at the calculus level of the mechanised reasoning system. We present an implementation which achieves this by adding a verbose mode to the computer algebra system which produces high-level protocol information that can be processed by an interface to derive proof plans. Such a proof plan in turn can be expanded to proofs at different levels of abstraction, so the approach is well-suited for producing a high-level verbalised explication as well as for a low-level (machine checkable) calculus-level proof.
This work was supported by the Deutsche Forschungsgemeinschaft in SFB 314 (D2)
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C. Ballarin, K. Homann, and J. Calmet. Theorems and algorithms: An interface between Isabelle and Maple. In A. H. M. Levelt, editor, Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC'95), pages 150–157. ACM Press, 1995.
R. S. Boyer and J S. Moore. Metafunctions. In R. S. Boyer and J Strother Moore, editors, The Correctness Problem in Computer Science, pages 103–184. Academic Press, 1981.
Alan Bundy, Andrew Stevens, Frank van Harmelen, Andrew Ireland, and Alan Smaill. Rippling: A heuristic for guiding inductive proofs. AI, 62:185–253, 1993.
Bruno Buchberger. Mathematische Software-Systeme: Drastische Erweiterung des “Intelligenzniveaus” entsprechender Programme erwartet. Informatik Spektrum, 19/2:100–101, 1996.
Alan Bundy, Frank van Harmelen, Christian Horn, and Alan Smaill. The OYSTER-CLAM system. In Mark E. Stickel, editor, Proceedings of the 10th CADE, pages 647–648, Kaiserslautern, Germany, 1990. Springer-Verlag.
Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet, Benton L. Leong, Michael B. Monagan, and Stephen M. Watt. First leaves: a tutorial introduction to Maple V. Springer-Verlag, 1992.
D. Clément, F. Montagnac, and V. Prunet. Integrated software components: A paradigm for control integration. In Proceedings of the European Symposium on Software Development Environments and CASE Technology, Springer-Verlag, LNCS 509, 1991.
Edmund Clarke and Xudong Zhao. Analytica — A theorem prover in mathematica. In Proceedings of the 11th CADE, pages 761–763, Saratoga Springs, New York, 1992, Springer-Verlag.
J. H. Davenport. The AXIOM system. AXIOM Technical Report TR5/92 (ATR/3) (NP2492), Numerical Algorithms Group, Inc., Downer's Grove, IL, USA and Oxford, UK, 1992.
Benno Fuchssteiner et al. (The MuPAD Group). MuPAD User's Manual. John Wiley and Sons, Chichester, first edition, 1996.
Michael Gordon, Robin Milner, and Christopher Wadsworth. Edinburgh LCF: A Mechanized Logic of Computation. LNCS 78. Springer-Verlag, 1979.
Fausto Giunchiglia, Paolo Pecchiari, and Carolyn Talcott. Reasoning theories — towards an architecture for open mechanized reasoning systems. IRST-Technical Report 9409-15, IRST (Istituto per la Ricerca Scientifica e Tecnologica), Trento, Italy, June 1994.
K. Homann and J. Calmet. An open environment for doing mathematics. In M. Wester, S. Steinberg, and M. Jahn, editors, Proceedings of 1st International IMACS Conference on Applications of Computer Algebra, Albuquerque, USA, 1995.
A. C. Hearn. Reduce user's manual: Version 3.3. Technical Report, Rand Corporation, Santa Monica, CA, USA, 1987.
Xiaorong Huang, Manfred Kerber, Michael Kohlhase, Erica Melis, Dan Nesmith, Jörn Richts, and Jörg Siekmann. Ω-mkrp: A proof development environment. In Alan Bundy, editor, Proceedings of the 12th CADE, pages 788–792, Nancy, 1994. Springer-Verlag, LNAI 814.
D. J. Howe. Computational Metatheory in Nuprl. In Lusk and Overbeek, editors, Proceedings of CADE 9, pages 238–257, 1988. Springer-Verlag.
J. Harrison and L. Théry. Extending the HOL theorem prover with a computer algebra system to reason about the reals. In C.-J. H. Seger J. J. Joyce, editor, Higher Order Logic Theorem Proving and its Applications (HUG '93), pages 174–184, 1993. Springer-Verlag, LNCS 780.
A. Karatsuba and Y. Ofman. Multiplication of Multidigit Numbers by Automata. Soviet Physics-Doklady, 1963.
Robert Kowalski. Algorithm=Logic + Control. CACM, 1979.
Francis Jeffry Pelletier. The philosophy of automated theorem proving. In John Mylopoulos and Ray Reiter, editors, Proceedings of the 12th IJCAI, pages 538–543, Sydney, 1991. Morgan Kaufmann.
S. Wolfram. Mathematica: A System for Doing Mathematics by Computer. Addison-Wesley, 1991.
Richard Zippel. Effective Polynomial Computation. Kluwer Academic Press, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kerber, M., Kohlhase, M., Sorge, V. (1996). Integrating computer algebra with proof planning. In: Calmet, J., Limongelli, C. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1996. Lecture Notes in Computer Science, vol 1128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61697-7_22
Download citation
DOI: https://doi.org/10.1007/3-540-61697-7_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61697-9
Online ISBN: 978-3-540-70635-9
eBook Packages: Springer Book Archive