Advertisement

Structures for symbolic mathematical reasoning and computation

  • Karsten Homann
  • Jacques Calmet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1128)

Abstract

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.

Keywords

Integration of computing and reasoning paradigms Interfaces 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Abbott, A. van Leeuwen, A. Strotmann Objectives of Open Math. Submitted to Journal of Symbolic Computation, 1995.Google Scholar
  2. 2.
    C. Ballarin, K. Homann, J. Calmet Theorems and Algorithms: An Interface between Isabelle and Maple. In A.H.M. Levelt (Ed.), Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC'95), pp. 150–157, ACM press, 1995.Google Scholar
  3. 3.
    B. Buchberger Mathematica: Doing Mathematics by Computer? In A. Miola (Ed.), Advances in the Design of Symbolic Computation Systems, Texts and Monographs in Symbolic Computation, Springer, 1996.Google Scholar
  4. 4.
    J. Calmet, K. Homann Distributed Mathematical Problem Solving. In Proceedings of 4th Bar-Ilan Symposium on Foundations of Artificial Intelligence (BISFAI'95), pp. 222–230, 1995.Google Scholar
  5. 5.
    J. Calmet, K. Homann Classification of Communication and Cooperation Mechanisms for Logical and Symbolic Computation Systems. In F. Baader, K.U. Schulz (Eds.), Proceedings of First International Workshop on Frontiers of Combining Systems (FroCoS'96), pp. 133–146, Kluwer Series on Applied Logic, 1996.Google Scholar
  6. 6.
    E. Clarke, X. Zhao Combining Symbolic Computation and Theorem Proving: Some Problems of Ramanujan. In A. Bundy (Ed.), Automated Deduction (CADE-12), pp. 758–763, LNAI 814, Springer, 1994.Google Scholar
  7. 7.
    W.M. Farmer, J.D. Guttman, F.J. ThayerIMPS: An Interactive Mathematical Proof System. In Journal of Automated Reasoning 11:213–248, 1993.Google Scholar
  8. 8.
    W.M. Farmer, J.D. Guttman, F.J. ThayerContexts in Mathematical Reasoning and Computation. In Journal of Symbolic Computation 19:201–216, 1995.Google Scholar
  9. 9.
    F. Giunchiglia, P. Pecchiari, C. Talcott Reasoning Theories — Towards an Architecture for Open Mechanized Reasoning Systems. In F. Baader, K.U. Schulz (Eds.), Proceedings of First International Workshop on Frontiers of Combining Systems (FroCoS'96), pp. 97–114, Kluwer Series on Applied Logic, 1996.Google Scholar
  10. 10.
    J. Harrison, L. Théry 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, LNCS 780, Springer, 1993.Google Scholar
  11. 11.
    K. Homann Symbolic Mathematical Problem Solving by Cooperation of Algorithmic and Logical Services, (in german), Dissertation, University of Karlsruhe, 1996.Google Scholar
  12. 12.
    P. Jackson Exploring Abstract Algebra in Constructive Type Theory. In A. Bundy (Ed.), Automated Deduction (CADE-12), pp. 590–604, LNAI 814, Springer, 1994.Google Scholar
  13. 13.
    N. Kajler CAS/PI: a Portable and Extensible Interface for Computer Algebra Systems. In Proceedings of ISSAC'92, pp. 376–386, ACM press, 1992.Google Scholar
  14. 14.
    M.B. Monagan, K.O. Geddes, K.M. Heal, G. Labahn, S. Vorkoetter Maple V Programming Guide, Springer, 1996.Google Scholar
  15. 15.
    L.C. Paulson Isabelle — A Generic Theorem Prover, LNCS 828, Springer, 1994.Google Scholar
  16. 16.
    C. Talcott Handles — Specialized logical services, Working Draft, 1994.Google Scholar
  17. 17.
    N. Venkatasubramanian, C. Talcott Reasoning about Meta Level Activities in Open Distributed Systems, to appear in PODC, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Karsten Homann
    • 1
  • Jacques Calmet
    • 1
  1. 1.Institut für Algorithmen und Kognitive SystemeUniversität KarlsruheKarlsruheGermany

Personalised recommendations