Abstract
There is an increasing evidence that a new generation of reasoning systems will be obtained via the integration of different reasoning paradigms. In the verification arena, several proposals have been advanced on the integration of theorem proving with model checking. At the same time, the advantages of integrating symbolic computation with deductive capabilities has been recognized and several proposals to this end have been put forward. We propose a methodology for turning reasoning specialists integrated in state-of-the-art reasoning systems into reusable and implementation independent reasoning components to be used in a “plug-and-play≓ fashion. To test our ideas we have used the Boyer and Moore’s linear arithmetic procedure as a case study. We report experimental results which confirm the viability of the approach.
We wish to thank Fausto Giunchiglia for very helpful discussions. We are also grateful to Alan Bundy and Alessandro Coglio for comments on an early draft of this paper. The authors are supported in part by Conferenza dei Rettori delle Università Italiane (CRUI) in collaboration with Deutscher Akademischer Austaunschdienst (DAAD) under the Vigoni Programme.
Preview
Unable to display preview. Download preview PDF.
References
J. Abbott, A. Díaz, and R. S. Sutor. A report on OpenMath. A protocol for the exchange of mathematical information. SIGSAM Bulletin (ACM Special Interest Group on Symbolic and Algebraic Manipulation), 30(1):21–24, March 1996.
A. Armando, P. Bertoli, A. Coglio, F. Giunchiglia, J. Meseguer, S. Ranise, and C. Talcott. Open Mechanized Reasoning Systems: a Preliminary Report. In Workshop on Integration of Deduction Systems (CADE-15), 1998.
C. Ballarin, K. Homann, and J. Calmet. Theorems and Algorithms: An Interface between Isabelle and Maple. In International Symposium on Symbolic and Algebraic Computation. ACM Press, 1995.
P.G. Bertoli, J. Calmet, F. Giunchiglia, and K. Homann. Specification and Combination of Theorem Provers and Computer Algebra Systems. In 4th International Conference Artificial Intelligence And Symbolic Computation, Plattsburgh, NY, USA, 1998.
R. S. Boyer and J. S. Moore. Integrating Decision Procedures into Heuristic Theorem Provers: A Case Study of Linear Arithmetic. Mach. Intel., (11):83–124, 1988.
B. Buchberger, T. Jebelean, F. Kriftner, M. Marin, E. Tomuta, and D. Vasaru. A Survey of the Theorema Project. In International Symposium on Symbolic and Algebraic Computation, Hawaii, USA, 1997.
E. Clarke and X. Zhao. Analytica — a Theorem Prover for Mathematica. Tech. Rep. CS-92-117, Carnegie Mellon University, 1992.
F. Giunchiglia, P. Pecchiari, and C. Talcott. Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems. Tech. Rep. 9409-15, IRST, 1994.
J. Harrison and L. Théry. A Sceptic’s Approach to Combining HOL and Maple. To appear in the J. of Automated Reasoning, 1997.
G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1990.
O. Müller and T. Nipkow. Combining Model Checking and Deduction for I/O-automata. In Tools and Algorithms for the Construction and Analysis of Systems, 1995.
S. Owre, J. Rushby, and N. Shankar. Integration in PVS: Tables, Types, and Model Checking. In Tools and Algorithms for the Construction and Analysis of Systems, Enschede, The Netherlands, 1997.
I. Sutherland and R. Platek. A Plea for Logical Infrastructure. In TTCP XTP-1 Workshop on Effective Use of Automated Reasoning Technology in System Development, 1992.
The OMRS Taskforce. The Open Mechanized Reasoning Systems Project WWW Page, http://www.mrg.dist.unige.it/omrs/.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Armando, A., Ranise, S. (1998). From integrated reasoning specialists to “plug-and-play≓ reasoning components. 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/BFb0055901
Download citation
DOI: https://doi.org/10.1007/BFb0055901
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