Rough Set Algebras as Description Domains

Authors:
Jānis Cīrulis
Affiliations:
(Correspd. Department of Computing, University of Latvia, 19 Raina b., Riga LV-1586, Latvia) Department of Computing, University of Latvia, 19 Raina b., Riga LV-1586, Latvia. janis.cirulis@lu.lv
Venue:
Fundamenta Informaticae
Year:
2009

Citing 8
Cited 0

Semantics of types for database objects

Theoretical Computer Science
Universal algebra

Handbook of logic in computer science (vol. 1)
Domain theory

Handbook of logic in computer science (vol. 3)
Contributions to the theory of rough sets

Fundamenta Informaticae
Logical and algebraic techniques for rough set data analysis

Rough set methods and applications
Rough Sets: Mathematical Foundations

Rough Sets: Mathematical Foundations
Double-faced rough sets and rough communication

Information Sciences—Applications: An International Journal
Complete Orders, Categories and Lattices of Approximations

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005

Quantified Score

Hi-index	0.02

Visualization

Abstract

Study of the so called knowledge ordering of rough sets was initiated by V.W. Marek and M. Truszczynski at the end of 90-ies. Under this ordering, the rough sets of a fixed approximation space form a domain in which every set ↓ is a Boolean algebra. In the paper, an additional operation inversion on rough set domains is introduced and an abstract axiomatic description of obtained algebras of rough set is given. It is shown that the resulting class of algebras is essentially different from those traditional in rough set theory: it is not definable, for instance, in the class of regular double Stone algebras, and conversely.