Classification of Communication and Cooperation Mechanisms for Logical and Symbolic Computation Systems

The combination of logical and symbolic computation systems has recently emerged from prototype extensions of stand-alone systems to the study of environments allowing interaction among several systems. Communication and cooperation mechanisms of systems performing any kind of mathematical service enable one to study and solve new classes of problems and to perform efficient computation by distributed specialized packages. 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. The methods are illustrated by recent well-known examples. We separate the classification into communication and cooperation methods. The former includes all aspects of the physical connection, the flow of mathematical information, the communication language(s) and its encoding, encryption, and knowledge sharing. The latter concerns the semantic aspects of architectures for cooperative problem solving

[1]  Richard J. Beach,et al.  CaminoReal: an interactive mathematical notebook , 1988 .

[2]  Stephen Wolfram,et al.  Mathematica: a system for doing mathematics by computer (2nd ed.) , 1991 .

[3]  Bruce W. Char,et al.  Maple V Library Reference Manual , 1992, Springer New York.

[4]  Bruce W. Char,et al.  Maple V Language Reference Manual , 1993, Springer US.

[5]  Norbert Kajler,et al.  CAS/PI: a portable and extensible interface for computer algebra systems , 1992, ISSAC '92.

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

[7]  Alan Bundy,et al.  Automated Deduction — CADE-12 , 1994, Lecture Notes in Computer Science.

[8]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[9]  Paul S. Wang,et al.  MP: a protocol for efficient exchange of mathematical expressions , 1994, ISSAC '94.

[10]  Matthias Fuchs,et al.  Goal Oriented Equational Theorem Proving Using Team Work , 1994, KI.

[11]  Jacques Calmet,et al.  Combining Theorem Proving and Symbolic Mathematical Computing , 1994, AISMC.

[12]  Paul B. Jackson.  Exploring Abstract Algebra in Constructive Type Theory , 1994, CADE.

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

[14]  J. Calmet,et al.  Distributed Mathematical Problem Solving , 1995 .

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