Abstract
Computer algebra systems (CASs) and automated theorem provers (ATPs) exhibit complementary abilities. CASs focus on efficiently solving domain-specific problems. ATPs are designed to allow for the formalization and solution of wide classes of problems within some logical framework. Integrating CASs and ATPs allows for the solution of problems of a higher complexity than those confronted by each class alone. However, most experiments conducted so far followed an ad-hoc approach, resulting in tailored solutions to specific problems. A structured and principled approach is necessary to allow for the sound integration of systems in a modular way. The Open Mechanized Reasoning Systems (OMRS) framework was introduced for the specification and implementation of mechanized reasoning systems, e.g. ATPs. The approach was recasted to the domain of computer algebra systems. In this paper, we introduce a generalization of OMRS, named OMSCS (Open Mechanized Symbolic Computation Systems). We show how OMSCS can be used to soundly express CASs, ATPs, and their integration, by formalizing a combination between the Isabelle prover and the Maple algebra system. We show how the integrated system solves a problem which could not be tackled by each single system alone.
Preview
Unable to display preview. Download preview PDF.
References
Abbott, J. PossoXDR specifications. Internal Posso technical report, 1994.
Armando, A., and Ranise, S. From Integrated Reasoning Specialists to “Plug-and-Play≓ Reasoning Components. In Proceedings of AISC’98, Springer Verlag.
Bertoli, P.Using OMRS for real: a case study withAcl2. PhD thesis, Computer Science Dept., University Rome 3, Rome, 1997. Forthcoming.
C. Ballarin, K. Homann, J. C. Theorems and Algorithms: An interface between Isabelle and Maple. In International Symposium on Symbolic and Agebraic Computation, ISSAC ’95 (1995), H. M. Levelt, Ed., ACM Press, pp. 150–157.
Calmet, J., and Homann, K. Structures for symbolic mathematical reasoning and computation. In Proceedings of DISCO ’96 — Design and Implementation of Symbolic Computation Systems (1996), J. Calmet and C. Limongelli, Eds.
Coglio, A. Definizione di un formalismo per la specifica delle strategie di inferenza dei sistemi di ragionamento meccanizzato e sua applicazione ad un sistema allo stato dell’arte. Master’s thesis, University of Genoa, Italy, 1996.
E. Clarke, X. Z. Analytica — a theorem prover in mathematica. In Proc. of the 10th Conference on Automated Deduction (1992), Springer-Verlag, pp. 761–765.
Giunchiglia, F., Pecchiari, P., and Talcott, C. Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems. Tech. Rep. 9409-15, IRST, Trento, Italy, 1994. Short version in Proc. of the First International Workshop on Frontiers of Combining Systems (FroCoS’96), Munich, Germany, 1996.
J. Harrison, L. T. Extending the HOL prover with a Computer Algebra System to reason about the Reals. In Higher Order Logic Theorem proving and its Applications, J. J. Joyce and J. H. Seger, Eds. Springer-Verlag, 1993, pp. 174–184.
Homann, K. Symbolisches Loesen mathematischer Probleme durch Kooperation algorithmischer und logischer Systeme. PhD thesis, Univ. of Karlsruhe, 1996.
Prawitz, D. Natural Deduction: A Proof-theoretical Study., 1965.
Vorkoetter, S. OpenMath specifications: March 1994, March 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertoli, P.G., Calmet, J., Giunchiglia, F., Homann, K. (1998). Specification and integration of theorem provers and computer algebra systems. In: Calmet, J., Plaza, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 1998. Lecture Notes in Computer Science, vol 1476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055905
Download citation
DOI: https://doi.org/10.1007/BFb0055905
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64960-1
Online ISBN: 978-3-540-49816-2
eBook Packages: Springer Book Archive