On lower and upper intension order relations by different cover concepts

In this paper, the concept of intension is used to introduce two types of ordering relations based on information that generates a cover for the universal set. These types of ordering relations are distinct from the well-known ordering relation based on set inclusion. For these ordering relations, we consider the algebraic structures that arise in various types of covers. We show that in the case of a representative cover, the algebraic structure resulting from the lower intension inclusion is a double Stone algebra, while in the case of a reduced cover, it is a Boolean algebra. In addition, the algebraic structure resulting from the upper intension inclusion in the case of a representative cover is a Boolean algebra, and in the case of a reduced cover, the two Boolean algebraic structures from lower and upper intension inclusions are isomorphic.

[1]  Xiaodong Liu,et al.  A new algebraic structure for formal concept analysis , 2010, Inf. Sci..

[2]  Wei-Zhi Wu,et al.  On axiomatic characterizations of three pairs of covering based approximation operators , 2010, Inf. Sci..

[3]  Chen Degang,et al.  A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets , 2007 .

[4]  G. Grätzer,et al.  Lattice Theory: First Concepts and Distributive Lattices , 1971 .

[5]  Murat Diker,et al.  Textural approach to generalized rough sets based on relations , 2010, Inf. Sci..

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

[7]  Rudolf Wille.  Restructuring mathematical logic: an approach based on Peirce's pragmatism , 1996 .

[8]  P. Wilcox,et al.  AIP Conference Proceedings , 2012 .

[9]  Daniel S. Yeung,et al.  Rough approximations on a complete completely distributive lattice with applications to generalized rough sets , 2006, Inf. Sci..

[10]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[11]  W. Zakowski.  APPROXIMATIONS IN THE SPACE (U,π) , 1983 .

[12]  Anna Gomolinska,et al.  A Comparative Study of Some Generalized Rough Approximations , 2002, Fundam. Informaticae.

[13]  Andrzej Skowron,et al.  Rough sets: Some extensions , 2007, Inf. Sci..

[14]  Qinghua Hu,et al.  Neighborhood classifiers , 2008, Expert Syst. Appl..

[15]  Fei Li,et al.  Approaches to knowledge reduction of covering decision systems based on information theory , 2009, Inf. Sci..

[16]  Yan Gao,et al.  On Covering Rough Sets , 2007, RSKT.

[17]  Lech Polkowski,et al.  Rough Sets in Knowledge Discovery 2 , 1998 .

[18]  William Zhu,et al.  Relationship between generalized rough sets based on binary relation and covering , 2009, Inf. Sci..

[19]  Daniel Vanderpooten,et al.  A Generalized Definition of Rough Approximations Based on Similarity , 2000, IEEE Trans. Knowl. Data Eng..

[20]  Tibor Katriňák,et al.  Injective double Stone algebras , 1974 .

[21]  Marzena Kryszkiewicz,et al.  Rules in Incomplete Information Systems , 1999, Inf. Sci..

[22]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[23]  Degang Chen,et al.  Fuzzy rough set theory for the interval-valued fuzzy information systems , 2008, Inf. Sci..

[24]  Yiyu Yao,et al.  Rough set approximations in formal concept analysis , 2004, IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04..

[25]  Qinghua Hu,et al.  Information-preserving hybrid data reduction based on fuzzy-rough techniques , 2006, Pattern Recognit. Lett..

[26]  Zdzislaw Pawlak,et al.  Probability, Truth and Flow Graph , 2003, RSKD.

[27]  Zengtai Gong,et al.  The further investigation of covering-based rough sets: Uncertainty characterization, similarity measure and generalized models , 2010, Inf. Sci..

[28]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[29]  Degang Chen,et al.  Fuzzy rough set theory for the interval-valued fuzzy information systems , 2008, Inf. Sci..

[30]  Andrzej Skowron,et al.  Rudiments of rough sets , 2007, Inf. Sci..

[31]  Fei-Yue Wang,et al.  Reduction and axiomization of covering generalized rough sets , 2003, Inf. Sci..

[32]  Kevin H. Knuth,et al.  Lattice Theory, Measures and Probability , 2007 .

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

[34]  William Zhu,et al.  Topological approaches to covering rough sets , 2007, Inf. Sci..

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

[36]  Rudolf Wille,et al.  Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts , 2009, ICFCA.

[37]  Andrzej Skowron,et al.  Rough sets and Boolean reasoning , 2007, Inf. Sci..

[38]  Manouchehr Vaziri,et al.  APPLICATION OF PARTIAL ORDER THEORY IN THE ASSESSMENT OF TRANSPORTATION SUSTAINABILITY FOR ISLAMIC COUNTRIES , 2006 .

[39]  Zbigniew Bonikowski,et al.  Algebraic Structures of Rough Sets in Representative Approximation Spaces , 2003, RSKD.

[40]  Urszula Wybraniec-Skardowska,et al.  Extensions and Intentions in the Ruogh Set Theory , 1998, Inf. Sci..