Category theory for computing science
Category theory for computing science
Basic category theory for computer scientists
Basic category theory for computer scientists
Theorems and algorithms: an interface between Isabelle and Maple
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Structures for Symbolic Mathematical Reasoning and Computation
DISCO '96 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Extending the HOL Theorem Prover with a Computer Algebra System to Reason about the Reals
HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
Specware: Formal Support for Composing Software
MPC '95 Mathematics of Program Construction
From Integrated Reasoning Specialists to ``Plug-and-Play'' Reasoning Components
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
Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems
Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems
Decision Making Modeled as a Theorem Proving Process
International Journal of Decision Support System Technology
Toward a trust model for knowledge-based communities
Proceedings of the 3rd International Conference on Web Intelligence, Mining and Semantics
| Hi-index | 0.00 |
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.