摘要
借助一般二元关系R构造了排异关系#,并由集合的补运算C及排异关系#构造了排异粗糙上近似算子U#与排异粗糙下近似算子L#,讨论了它们的基本性质。
In this paper,the preclusive relation # is constructed based on general binary relations,the preclusivity rough upper and lower approximations are defined using complement operator C and preclusive relation #.Furthermore,the basic properties of these approximation operators are discussed.
出处
《西华大学学报（自然科学版）》
CAS
2012年第3期53-56,共4页
Journal of Xihua University:Natural Science Edition
基金
国家自然科学基金资助课题(60875034)
关键词
粗糙集
排异关系
近似算子
rough set
preclusive relation
approximation operator
