Skip to main content
Conference Proceedings

Lattice-based relation algebras II

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4342 LNAI 267-289
DOI: 10.1007/11964810_13
8Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present classes of algebras which may be viewed as weak relation algebras, where a Boolean part is replaced by a not necessarily distributive lattice. For each of the classes considered in the paper we prove a relational representation theorem. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Düntsch, I., Orlowska, E., & Radzikowska, A. M. (2006). Lattice-based relation algebras II. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4342 LNAI, pp. 267–289). https://doi.org/10.1007/11964810_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free