Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
The foundation of a generic theorem prover
Journal of Automated Reasoning
Artificial Intelligence
Theorems and algorithms: an interface between Isabelle and Maple
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
A survey of the Theorema project
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
A Skeptic’s Approach to Combining HOL and Maple
Journal of Automated Reasoning
Termination of Constraint Contextual Rewriting
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Composing and Controlling Search in Reasoning Theories Using Mappings
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
From Integrated Reasoning Specialists to ``Plug-and-Play'' Reasoning Components
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
Specification and Integration of Theorem Provers and Computer Algebra Systems
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
Analytica - A Theorem Prover in Mathematica
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Exploring Abstract Algebra in Constructive Type Theory
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems
Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems
Theorem Proving with the Real Numbers
Theorem Proving with the Real Numbers
Contextual Rewriting In Automated Reasoning
Fundamenta Informaticae
| Hi-index | 0.00 |
We are interested in developing a methodology for integrating mechanized reasoning systems such as Theorem Provers, Computer Algebra Systems, and Model Checkers. Our approach is to provide a framework for specifying mechanized reasoning systems and to use specifications as a starting point for integration. We build on the work presented by Giunchiglia et al.(1994) which introduces the notion of Open Mechanized Reasoning Systems (OMRS) as a specification framework for integrating reasoning systems. An OMRS specification consists of three components: the logic component, the control component, and the interaction component. In this paper we focus on the control level. We propose to specify the control component by first adding control knowledge to the data structures representing the logic by means of annotations and then by specifying proof strategies via tactics. To show the adequacy of the approach we present and discuss a structured specification of constraint contextual rewriting as a set of cooperating specialized reasoning modules. 2001 Academic Press.