Lattice-Based relation algebras II

Authors:
Ivo Düntsch;Ewa Orłowska;Anna Maria Radzikowska
Affiliations:
Brock University, St. Catharines, Ontario, Canada;National Institute of Telecommunications, Warsaw, Poland;Faculty of Mathematics and Information Science, Warsaw University of Technology, Warsaw, Poland
Venue:
TARSKI'02-05 Proceedings of the 2006 international conference on Theory and Applications of Relational Structures as Knowledge Instruments - Volume 2
Year:
2006

Citing 6
Cited 3

Beyond modalities: sufficiency and mixed algebras

Relational methods for computer science applications
Incomplete Information: Structure, Inference, Complexity

Incomplete Information: Structure, Inference, Complexity
Information Algebras

AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Gaggle Theory: An Abstraction of Galois Connections and Residuation with Applications to Negation, Implication, and Various Logical Operations

JELIA '90 Proceedings of the European Workshop on Logics in AI
Double Residuated Lattices and Their Applications

ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Rough Relation Algebras Revisited

Fundamenta Informaticae

Representation theorems for some fuzzy logics based on residuated non-distributive lattices

Fuzzy Sets and Systems
Discrete Duality and Its Applications to Reasoning with Incomplete Information

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Structures with Multirelations, their Discrete Dualities and Applications

Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa

Quantified Score

Hi-index	0.00

Visualization

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.