Skip to main content
SpringerLink
Log in

Building bridges between knowledge representation and algebraic specification

  • Communications
  • Conference paper
  • First Online:
Methodologies for Intelligent Systems (ISMIS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 869))

Included in the following conference series:

Abstract

An approach to transforming the algebraic specification of a mathematical domain of computation into a knowledge base, preserving the semantics determined in the specification, is introduced. It involves the algebraic specification language Formal-⌆ and the hybrid knowledge representation system Mantra. In the framework of Formal-⌆ mathematical domains of computation are represented algebraically. The transformation aims at achieving the executability of a specification.

This research was funded in part by Institute of Robotics and Intelligent Systems and by Natrural Sciences and Engineering Research Council of Canada

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N.D. Belnap. A useful four-valued logic. In J.M. Dunn and G. Epstein, editors, Modern Use of Multiple-Valued Logics. D. Reidel, 1977.

    Google Scholar 

  2. R.J. Brachman, R.E. Fikes, and H.J. Levesque. Krypton: A functional approach to knowledge representation. IEEE Computer, 16(10), pp. 67–73, October 1983.

    Google Scholar 

  3. G. Bittencourt. An Architecture for Hybrid Knowledge Representation. PhD thesis, Universität Karlsruhe, Institut für Algorithme und Kognitive Systeme, 1990.

    Google Scholar 

  4. J. Calmet and I.A. Tjandra. A unified-algebra-based specification language for symbolic computing. In A. Miola, editor, Design and Implementaion of Symbolic Computation Systems. Springer-Verlag, LNCS 722, pp. 122–133, 1993.

    Google Scholar 

  5. J. Calmet, I.A. Tjandra, and G. Bittencourt. Mantra: A shell for hybrid knowledge representation. In E. Lee, B. Wah, N.G. Bourbakis, and W.T. Tsai, editors, Tools for Artificial Intelligence, pp. 164–171. IEEE Computer Society Press, 1991.

    Google Scholar 

  6. H. Ehrig and B. Mahr. Fundamental of Algebraic Specification 2. Monograph on Theoretical Computer Science, vol 21. Springer-Verlag, 1990.

    Google Scholar 

  7. D.W. Etherington. Reasoning with Incomplete Information: Investigation of Nonmonotonic Reasoning. PhD thesis, University of British Columbia, Vencouver, CS, 1986.

    Google Scholar 

  8. J.H. Fasel, P. Hudak, S.P. Jones, and P. Wadler. SIGPLAN notices special issue on the functional programming language Haskell. ACM Sigplan Notices, 27(5):1, 1992.

    Google Scholar 

  9. P.D. Mosses. Unified algebras and institutions. In Logics in Computer Science, pp. 304–312. IEEE Press, 1989.

    Google Scholar 

  10. P.F. Patel-Schneider. Small can be beautiful in knowledge representation. In Proceedings of Workshop on Principle of Knowldege-Based Systems, pages 11–19. IEEE, 1984.

    Google Scholar 

  11. P.F. Patel-Schneider. A decidable first-order logic for knowledge representation. Journal of Automated Reasoning, 6, pp. 361–388, 1990.

    Google Scholar 

  12. D Sanella. A set-theoretic semantics of Clear. Acta Informatica, 21(5), pp. 443–472, 1984.

    Google Scholar 

  13. B. Stroustrup. The C++ Programming Language. Addison Wesley, 2nd edition, 1993.

    Google Scholar 

  14. R.S. (Ed.) Sutor. Axiom User's Guide. The Numerical Algorithm Group Limited, 1991.

    Google Scholar 

  15. R.H. Thomason, J.F. Horty, and D.S. Touretzky. A calculus for inheritance in monotonic semantic nets. CMU-CS-86-138, Carnegie Mellon Univeristuy, Dept. of CS, 1986.

    Google Scholar 

  16. I.A. Tjandra. Algebraic Specification of Mathematical Domains of Computation and Type Polymorphisms in Symbolic Computing (in German). PhD thesis, University of Karlsruhe, Dept. of CS, 1993.

    Google Scholar 

  17. M. Vilain. The restriction language architecture of a hybrid representation system. In Proceeding of 9th IJCAI, pp. 547–551, 1985.

    Google Scholar 

  18. M.H. VanEmden and K. Yukawa. Logic programming with equations. The Journal of Logic Programming, 4, pp. 265–288, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IAKS, Universität Karlsruhe, Postfach 6980, 76128, Karlsruhe, Germany

    Jacques Calmet

  2. Dept. of CS PQ, Concordia University, H3G 1M8, Montreal, Canada

    Indra A. Tjandra

Authors
  1. Jacques Calmet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Indra A. Tjandra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zbigniew W. Raś Maria Zemankova

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Calmet, J., Tjandra, I.A. (1994). Building bridges between knowledge representation and algebraic specification. In: Raś, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1994. Lecture Notes in Computer Science, vol 869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58495-1_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-58495-1_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58495-7

  • Online ISBN: 978-3-540-49010-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation