首页|The structure of rough sets defined by reflexive relations

The structure of rough sets defined by reflexive relations

扫码查看
原文链接
  • NETL
  • NSTL
  • Elsevier
For several types of information relations, the induced rough sets system RS does not form a lattice but only a partially ordered set. However, by studying its Dedekind-MacNeille completion DM(RS), one may reveal new important properties of rough set structures. Building upon D. Umadevi's work on describing joins and meets in DM(RS), we previously investigated pseudo-Kleene algebras defined on DM(RS) for reflexive relations. This paper delves deeper into the order-theoretic properties of DM(RS) in the context of reflexive relations. We describe the completely join-irreducible elements of DM(RS) and characterize when DM(RS) is a spatial completely distributive lattice. We show that even in the case of a non-transitive reflexive relation, DM(RS) can form a Nelson algebra, a property generally associated with quasiorders. We introduce a novel concept, the core of a relational neighbourhood, and use it to provide a necessary and sufficient condition for DM(RS) to determine a Nelson algebra.

Rough setReflexive relationLattice structureDedekind-MacNeille completionParaorthomodular latticeCompletely join-prime elementCompletely join-irreducible elementCore elementKleene algebraNelson algebraQuasiorderKLEENE ALGEBRASNELSON ALGEBRASSPACES

Jarvinen, Jouni、Radeleczki, Sandor

展开 >

LUT Sch Engn Sci

Univ Miskolc

2025

10.1016/j.ijar.2025.109471

International journal of approximate reasoning

International journal of approximate reasoning

SCI
ISSN：0888-613X
年,卷(期)：2025.185(Oct.)
  • 38