Discrete Duality for Rough Relation Algebras

Authors:
Ivo Düntsch;Ewa Orłowska
Affiliations:
Brock University, St. Catharines, Ontario, Canada, L2S 3A1, duentsch@brocku.ca;National Institute of Telecommunications, Szachowa 1, 04--894 Warsaw, Poland. orlowska@itl.waw.pl
Venue:
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Year:
2013

Citing 7
Cited 0

A logic for rough sets

Theoretical Computer Science
Incomplete Information: Structure, Inference, Complexity

Incomplete Information: Structure, Inference, Complexity
Discrete Duality and Its Applications to Reasoning with Incomplete Information

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Discrete Duality for Relation Algebras and Cylindric Algebras

RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Discrete Dualities for Double Stone Algebras

Studia Logica
Rough Relation Algebras Revisited

Fundamenta Informaticae
Rough Relation Algebras

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rough relation algebras are a generalization of relation algebras such that the underlying lattice structure is a regular double Stone algebra. Standard models are algebras of rough relations. A discrete duality is a relationship between classes of algebras and classes of relational systems frames. In this paper we prove a discrete duality for a class of rough relation algebras and a class of frames.