Rough approximations via ideal on a complete completely distributive lattice

Soft Computing - A Fusion of Foundations, Methodologies and Applications(2015)

Cited 3|Views49
No score
Abstract
The rough approximations on a complete completely distributive lattice L based on binary relation were introduced by Zhou and Hu (Inf Sci 269:378–387, 2014 ), where the binary relation was defined on the set of non-zero join-irreducible elements. This paper extends Zhou and Hu’s rough set model by defining new approximation operators via ideal. When I is the least ideal of L and R is a reflexive binary relation, these two approximations coincide. We present the essential properties of new approximations and also discuss how the new one relates to the old one. Finally, the topological and lattice structures of the approximations are given.
More
Translated text
Key words
Rough set,Complete completely distributive lattice,Binary relation,Ideal
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined