排异粗糙近似算子相关性质的研究

摘要

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.%借助一般二元关系R构造了排异关系#,并由集合的补运算C及排异关系#构造了排异粗糙上近似算子U#与排异粗糙下近似算子L#,讨论了它们的基本性质.