Generalized Rough Sets (Preclusivity Fuzzy-Intuitionistic (BZ) Lattices)

被引：48

作者：

Cattaneo G. ^{[1
]}

机构：

[1] Dipartimento di Scienze Dell'informazione, Università di Milano, 20135 Milano

来源：

Studia Logica | 1997年 / 58卷 / 1期

关键词：

Brouwer-zadeh structures; Discernibility relations; Fuzzy-intuitionistic algebras with modalities; Generalized rough sets;

D O I：

10.1023/A:1004939914902

中图分类号：

学科分类号：

摘要：

The standard Pawlak approach to rough set theory, as an approximation space consisting of a universe U and an equivalence ("indiscernibility") relation R ⊆ U × U, can be equivalently described by the induced preclusivity ("discernibility") relation U × U\R, which is irreflexive and symmetric. We generalize the notion of approximation space as a pair consisting of a universe U and a discernibility or preclusivity (irreflexive and symmetric) relation, not necessarily induced from an equivalence relation. In this case the "elementary" sets are not mutually disjoint, but all the theory of generalized rough sets can be developed in analogy with the standard Pawlak approach. On the power set of the universe, the algebraic structure of the quasi fuzzy-intuitionistic "classical" (BZ) lattice is introduced and the sets of all "closed" and of all "open" definable sets with the associated complete (in general nondistributive) ortholattice structures are singled out. The rough approximation of any fixed subset of the universe is the pair consisting of the best "open" approximation from the bottom and the best "closed" approximation from the top. The properties of this generalized rough approximation mapping are studied in the context of quasi-BZ lattice structures of "closed-open" ordered pairs (the "algebraic logic" of generalized rough set theory), comparing the results with the standard Pawlak approach. A particular weak form of rough representation is also studied. © 1997 Kluwer Academic Publishers.

引用

页码：47 / 77

页数：30

共 18 条

[11] Moisil G.C., Notes sur les logiques nonchrysippiennes, Ann. Sci. Univ. Jassy, 27, pp. 86-98, (1941)
[12] Orlowska E., A logic of indiscrenibility relations, Lecture Notes in Computer Sciences, 208, pp. 177-186, (1985)
[13] Pawlak Z., Rough sets, Internat. J. Inform. Comput. Sci., 11, pp. 341-356, (1982)
[14] Pawlak Z., Rough sets and fuzzy sets, Fuzzy Sets Syst., 17, pp. 99-102, (1985)
[15] Vakarelov D., A modal logic for similarity relations in Pawlak knowledge representation systems, Fundamenta Informaticae, 15, pp. 61-79, (1991)
[16] Yao Y.Y., Li X., Lin T.Y., Liu Q., Representation and classification of rough set models, Proc. of "The Third International Workshop on Rough Sets and Soft Computing ", pp. 630-637, (1994)
[17] Zadeh L.A., Fuzzy sets, Inform. Contr., 8, pp. 338-353, (1965)
[18] Zakowski W., Approximations in the space (U,II), Demonstratio Mathematica, 16, pp. 761-769, (1983)

← 1 2 →