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

Part of the Applied Logic Series book series (APLS, volume 3)


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


Mathematical Object Theorem Prove Computer Algebra System Communication Language Input Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. J. Abbott PossoXDR Specifications. In Posso project internal report, 1994.Google Scholar
  2. J. Abbott, A. van Leeuwen, A. Strotmann Objectives of OpenMath. Submitted to Journal of Symbolic Computation, 1995.Google Scholar
  3. D.Arnon, R. Beach, K. McIsaac, C. Waldspurger CaminoReal: an Interactive Mathematical Notebook. In Proceedings of International Conference on Electronic Publishing, Document Manipulation and Typography, Cambridge University Press, 1988.Google Scholar
  4. C. Ballarin, K. Homann, J. Calmet Theorems and Algorithms: An Interface between Isabelle and Maple. In A.H.M. Le- velt (Ed.), Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC’95), pp. 150–157, ACM Press, 1995.Google Scholar
  5. J. Calmet, K. Homann Distributed Mathematical Problem Solving. In E. Shamir, M. Koppel (Eds.), Proceedings of 4th Bar-llan Symposium on Foundations of Artificial Intelligence (BIS- FAI’95), pp. 222–230, 1995.Google Scholar
  6. B.W. Char, K.O. Geddes, G.H. Gönnet, B.L. Leong, M.B. Monagan, S.M. Watt Maple V Language Reference Manual, Springer-Verlag, 1992.Google Scholar
  7. E.Clarke, X. Zhao Analytica - An Experiment in Combining Theorem Proving and Symbolic Computation. Carnegie Mellon University, Technical Report CMU-CS-92–147, 1992.Google Scholar
  8. J. Denzinger, M. Fuchs Goal oriented equational theorem proving using team work. In B. nebel (Ed.), Proceedings of 18th German Annual Conference on Artificial Intelligence (KI’94), pp. 343–354, Lecture Notes in Artificial Intelligence 861, Springer-Verlag, 1994.Google Scholar
  9. W.W. McCune OTTER 3.0 Reference Manual and Guide, Technical Report ANL-94/6, Argonne National Labaratory, 1994.CrossRefGoogle Scholar
  10. S. Dalmas, M. Gaetano, A. Sausse Distributed Computer Algebra: the Central Control Approach. In h. hong (Ed.), Proceedings of 1st International Conference on Parallel Symbolic Computation (PASCO’94), pp. 104–113, Lecture Notes in Computing 5, World Science, 1994.Google Scholar
  11. F.Giunchiglia, P. Pecchiari, C. Talcott Reasoning Theories - Towards an Architecture for Open Mechanized Reasoning Systems. In Proceedings of First International Workshop Frontiers of Combining Systems (FroCoS’96), Kluwer, 1996.Google Scholar
  12. S. Gray, N. Kajler, P. Wang MP: A Protocol for Efficient Exchange of Mathematical Expressions. In Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC’94), ACM Press, 1994.Google Scholar
  13. J. Harrison, L. Thery Extending the HOL Theorem Prover with a Computer Algebra System to Reason About the Reals. In J.J. Joyce, C.-J.H. seger (Eds.), Higher Order Logic Theorem Proving and its Applications (HUG’93), pp. 174–184, Lecture Notes in Computer Science 780, Springer-Verlag, 1993.Google Scholar
  14. K. HOMANN, J. CALMET Combining Theorem Proving and Symbolic Mathematical Computing. In J. CALMET, J .A. CAMPBELL (Eds.), Integrating Symbolic Mathematical Computation and Artificial Intelligence (AISMC-2), pp. 18–29, Lecture Notes in Computer Science 958, Springer-Verlag, 1995.CrossRefGoogle Scholar
  15. P. Jackson Exploring Abstract Algebra in Constructive Type Theory. In A. bundy (Ed.), Automated Deduction (CADE-12), pp. 590–604, Lecture Notes in Artificial Intelligence 814, Springer-Verlag, 1994.Google Scholar
  16. N. KAJLER CAS/PI: a Portable and Extensible Interface for Computer Algebra Systems. In Proceedings of International Symposium on Symbolic and Algebraic Computation (IS- SAC’92), pp. 376–386, ACM Press, 1992.Google Scholar
  17. S. Wolfram Mathematica: a System for Doing Mathematics by Computer, Addison-Wesley, 1991.Google Scholar
  18. Wolfram Research Inc. MathLink Reference Guide Version 2.2, Mathematica Technical Report, Wolfram Research, 1993.Google Scholar

Copyright information

© Springer Science+Business Media New York 1996

Authors and Affiliations

  1. 1.Institut für Algorithmen und Kognitive SystemeUniversität KarlsruheGermany

Personalised recommendations