Structures for Symbolic Mathematical Reasoning and Computation

  title={Structures for Symbolic Mathematical Reasoning and Computation},
  author={Karsten Homann and Jacques Calmet},
Recent research towards integrating symbolic mathematical reasoning and computation has led to prototypes of interfaces and environments. This paper introduces computation theories and structures to represent mathematical objects and applications of algorithms occuring in algorithmic services. The composition of reasoning and computation theories and structures provide a formal framework for the specification of symbolic mathematical problem solving by cooperation of algorithms and theorems. 
An Overview of a Formal Framework for Managing Mathematics
This paper presents an overview of a formal framework for managing the mathematics process as well as the mathematical knowledge produced by the process, which includes the notion of a biform theory which is simultaneously an axiomatic theory and an algorithmic theory.
R O M a Complex and Hyper-complex Numbers: a Case Study for the Combination of Algebraic Computation and D E D Uction
Recent work investigates the combination of Computer Algebra Systems and Automated Theorem Provers. We elaborate a concrete example: the generic construction of complex numbers, quaternions, Cayley
Towards the Mathematics Software Bus
Specification and Integration of Theorem Provers and Computer Algebra Systems
OMSCS (Open Mechanized Symbolic Computation Systems) is introduced, showing 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.
Computer algebra and artificial intelligence
The evidence algorithm and problems of representation and processing of mathematical computer knowledge
A series of research works on the realization of the “evidence algorithm” program initiated by V. M. Glushkov in the sixties is described. The works are planned in the context of a new understanding
Assertion level proof planning with compiled strategies
Two complementary methods provide a framework to automate declarative proofs at the assertion level by lifting the logical basis to the abstract assertion level, which has been identified as a style of reasoning that can be found in textbooks.
Decision Making Modeled as a Theorem Proving Process
A theoretical framework enabling to process decisions making along some of the lines and methodologies used to mechanize mathematics and more specifically to mechanizes the proofs of theorems to build tools using advanced mathematics for users without specific mathematical knowledge.
Ω mega – A Mathematical Assistant System
Classical automated theorem provers can prove non-trivial mathematical theorems in highly specific settings. However they are generally unable to cope with even moderately difficult theorems in
Abstraction-Based Information Technology: A Framework for Open Mechanized Reasoning
The main motivation is to claim that Artificial Intelligence is gaining enough strength and power to reach new frontiers and to turn challenges that are not a priori of a purely computational nature into AI domains.


Context in Mathematical Reasoning and Computation
Some context-based techniques for symbolic computation are described, including techniques for reasoning about definedness, simplifying abstract algebraic expressions, and computing with theorems in the IMPS Interactive Mathematical Proof System.
Advances in the Design of Symbolic Computation Systems
A general reasoning apparatus for intelligent tutoring systems in mathematics and enhanced strict inheritance in TASSO-L are presented.
Distributed Mathematical Problem Solving
This work reports on an ongoing research project whose long term goal is to provide an open environment for doing mathematics including reasoners and symbolic calculators which is extensible by users which can construct complex systems by combination and insertion of existing packages.
Combining Symbolic Computation and Theorem Proving: Some Problems of Ramanujan
A theorem prover is developed based on the symbolic computation system Mathematica that can prove all the challenge problems completely automatically and the axioms and inference rules for constructing the proofs are discussed.
Theorems and algorithms: an interface between Isabelle and Maple
A prototype implementation of an interface between Isabelle and Maple is described by extending the simplifier of Isabelle through the introduction of a new class of simplification rules called evaluation rules in order to make selected operations of Maple available, and without any modification to the computer algebra system.
Extending the HOL Theorem Prover with a Computer Algebra System to Reason about the Reals
An environment for reasoning about the reals which combines the rigour of a theorem prover with the power of a computer algebra system is described.
Classification of Communication and Cooperation Mechanisms for Logical and Symbolic Computation Systems
The classification of communication and cooperation methods for logical and symbolic computation systems given in this paper provides and surveys different methodologies for combining mathematical services and their characteristics, capabilities, requirements, and differences.
Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems
This paper proposes a general architecture for a class of reasoning modules and systems called Open Mechanized Reasoning Systems (OMRSs), and develops the theory underlying the reasoning theory component.
Exploring Abstract Algebra in Constructive Type Theory
It is shown how Nuprl's expressive type theory is used to define classes of free abelian monoids and free monoid algebras that are combined to create a class of all implementations of polynomials.
Mathematica: doing mathematics by computer?
It is shown that the goal of “doing mathematics by computer” may well be achieved by suitable modifications and extensions of Mathematica and similar systems and the analysis applies to all current systems in this category.