论文信息 - Rough sets on atomic Boolean lattices

Rough sets on atomic Boolean lattices

In this paper, the lower and upper generalized rough approximation operators on complete atomic Boolean lattices are studied by means of constructive and axiomatic approaches. In constructive approach, a pair of lower and upper rough approximation operators is first defined. The connections between binary relations on complete atomic Boolean lattices and rough approximation operators are established. In axiomatic approach, the axiomatic characterization of various classes of approximation operators are given.

[1] Yiyu Yao,et al. Two views of the theory of rough sets in finite universes , 1996, Int. J. Approx. Reason..

[2] Marzena Kryszkiewicz,et al. Rough Set Approach to Incomplete Information Systems , 1998, Inf. Sci..

[3] Tsau Young Lin,et al. Rough Approximate Operators: Axiomatic Rough Set Theory , 1993, RSKD.

[4] Helmut Thiele,et al. On axiomatic characterisations of crisp approximation operators , 2000, Inf. Sci..

[5] G. Grätzer. General Lattice Theory , 1978 .

[6] Yiyu Yao,et al. Generalization of Rough Sets using Modal Logics , 1996, Intell. Autom. Soft Comput..

[7] Wei-Zhi Wu,et al. Generalized fuzzy rough sets , 2003, Inf. Sci..

[8] Janusz Zalewski,et al. Rough sets: Theoretical aspects of reasoning about data , 1996 .

[9] Yiyu Yao,et al. Constructive and Algebraic Methods of the Theory of Rough Sets , 1998, Inf. Sci..

[10] Brian A. Davey,et al. An Introduction to Lattices and Order , 1989 .

[11] Jouni Järvinen. On the Structure of Rough Approximations , 2002, Fundam. Informaticae.

[12] Wei-Zhi Wu,et al. Constructive and axiomatic approaches of fuzzy approximation operators , 2004, Inf. Sci..