Specification and Integration of Theorem Provers and Computer Algebra Systems

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 solutions tailored 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. 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.

[1]  D. Prawitz Natural Deduction: A Proof-Theoretical Study , 1965 .

[2]  Fausto Giunchiglia,et al.  Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems , 1994, FroCoS.

[3]  Richard Jüllig,et al.  Specware: Formal Support for Composing Software , 1995, MPC.

[4]  Edmund M. Clarke,et al.  Analytica - A Theorem Prover in Mathematica , 1992, CADE.

[5]  S. Lane Categories for the Working Mathematician , 1971 .

[6]  Benjamin C. Pierce,et al.  Basic category theory for computer scientists , 1991, Foundations of computing.

[7]  Fausto Giunchiglia,et al.  Composing and Controlling Search in Reasoning Theories Using Mappings , 2000, FroCoS.

[8]  Richard W. Weyhrauch,et al.  Prolegomena to a theory of formal reasoning , 1978 .

[9]  Alessandro Armando,et al.  From Integrated Reasoning Specialists to "Plug-and-Play" Reasoning Components , 1998, AISC.

[10]  Karsten Homann,et al.  Symbolisches Lösen mathematischer Probleme durch Kooperation algorithmischer und logischer Systeme , 1997, DISKI.

[11]  Jacques Calmet,et al.  Structures for Symbolic Mathematical Reasoning and Computation , 1996, DISCO.

[12]  Arnon Avron,et al.  Simple Consequence Relations , 1988, Inf. Comput..

[13]  Jacques Calmet,et al.  Classification of Communication and Cooperation Mechanisms for Logical and Symbolic Computation Systems , 1996, FroCoS.

[14]  John Harrison,et al.  Extending the HOL Theorem Prover with a Computer Algebra System to Reason about the Reals , 1993, HUG.

[15]  Jacques Calmet,et al.  Theorems and algorithms: an interface between Isabelle and Maple , 1995, ISSAC '95.

[16]  José Meseguer,et al.  Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..