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 to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Birkhoff, G., Bartee, T.C.: Modern Applied Algebra, McGraw Hill, (1974)
Category Theory and Computer Programming, Lecture Notes in Computer Science, Vol.240. Springer-Verlag (1986)
Georgescu, J.: A categorical approach to knowledge-based systems. In: Comput. Artificial Int. (1) Springer-Verlag (1984) 105–113
MacLane, S.: Categories for the Working Mathematician. Springer (1971)
Plotkin, B.I.: Universal Algebra, Algebraic Logic, and Databases. Kluwer Acad. Publ. (1994)
Plotkin, B.I.: Algebra, categories, and databases. In: Handbook of algebra, Vol. 2. Elsevier (2000) 81–148
Plotkin, B.I., Plotkin, T.: Geometrical Aspect of Databases and Knowledgebases. Algebra Universalis (2001) to appear
Plotkin, T. Relational databases equivalence problem In: Advances of databases and information systems. Springer (1996) 391–404
Scott, P.J.: Some aspects of categories in computer science. In: Handbook of algebra, Vol. 2. Elsevier (2000) 5–77
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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