Universal algebra and computer science

Boris Plotkin, Tanya Plotkin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsRusins Freivalds
PublisherSpringer Verlag
Pages35-44
Number of pages10
ISBN (Print)9783540446699
DOIs
StatePublished - 2001
Event13th International Symposium on Fundamentals of Computation Theory, FCT 2001 - Riga, Latvia
Duration: 22 Aug 200124 Aug 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2138
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Symposium on Fundamentals of Computation Theory, FCT 2001
Country/TerritoryLatvia
CityRiga
Period22/08/0124/08/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Fingerprint

Dive into the research topics of 'Universal algebra and computer science'. Together they form a unique fingerprint.

Cite this