Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 2001: Fundamentals of Computation Theory pp 35–44Cite as

Universal Algebra and Computer Science

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2138))

Abstract

This paper considers interrelations between universal algebra, algebraic logic, geometry and computer science. The key idea of the paper is to show that problems, coming from computer science, require introducing of highly non-trivial mathematical structures. On the other hand, algebraic models in computer science give deeper understanding of problems essence.

This general idea is illustrated on the example of knowledge bases. Theorems concerning the knowledge base equivalence problem are formulated.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Birkhoff, G., Bartee, T.C.: Modern Applied Algebra, McGraw Hill, (1974)

    Google Scholar 

  2. Category Theory and Computer Programming, Lecture Notes in Computer Science, Vol.240. Springer-Verlag (1986)

    Google Scholar 

  3. Georgescu, J.: A categorical approach to knowledge-based systems. In: Comput. Artificial Int. (1) Springer-Verlag (1984) 105–113

    Google Scholar 

  4. MacLane, S.: Categories for the Working Mathematician. Springer (1971)

    Google Scholar 

  5. Plotkin, B.I.: Universal Algebra, Algebraic Logic, and Databases. Kluwer Acad. Publ. (1994)

    Google Scholar 

  6. Plotkin, B.I.: Algebra, categories, and databases. In: Handbook of algebra, Vol. 2. Elsevier (2000) 81–148

    Google Scholar 

  7. Plotkin, B.I., Plotkin, T.: Geometrical Aspect of Databases and Knowledgebases. Algebra Universalis (2001) to appear

    Google Scholar 

  8. Plotkin, T. Relational databases equivalence problem In: Advances of databases and information systems. Springer (1996) 391–404

    Google Scholar 

  9. Scott, P.J.: Some aspects of categories in computer science. In: Handbook of algebra, Vol. 2. Elsevier (2000) 5–77

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, The Hebrew University, Jerusalem, 91904, Israel

    Boris Plotkin

  2. Department of Mathematics and Computer Science, Bar-Ilan University, 52-900, Ramat-Gan, Israel

    Tanya Plotkin

Authors
  1. Boris Plotkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tanya Plotkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Latvia, Raiņa bulvaris 29, LV-1459, Riga, Latvia

    Rūsiņš Freivalds

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plotkin, B., Plotkin, T. (2001). Universal Algebra and Computer Science. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-44669-9_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42487-1

  • Online ISBN: 978-3-540-44669-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation