Rough approximations in complete Boolean lattice

被引：0
|
作者：
Yang, QJ [1 ]
Chen, C [1 ]
Qi, ZQ [1 ]
机构：
[1] Renmin Univ China, Sch Informat, Beijing 100872, Peoples R China
来源：
PROCEEDINGS OF THE 2005 IEEE INTERNATIONAL CONFERENCE ON NATURAL LANGUAGE PROCESSING AND KNOWLEDGE ENGINEERING (IEEE NLP-KE'05) | 2005年
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We study rough approximations in a lattice- theoretical setting. We first explore two pairs of rough approximations in complete Boolean lattice which mimic the pawlak rough approximations. Properties of each pair of upper and lower approximation operators in complete Boolean lattice setting are then studied. Furthermore, we show that the two pairs of rough approximations we present are equivalent in case when the lattice map is extensive and closed.
引用
收藏
页码：791 / 795
页数：5
相关论文
共 50 条
  • [1] On modified soft rough sets on a complete atomic Boolean lattice
    Heba I. Mustafa
    Journal of the Egyptian Mathematical Society, 27 (1)
  • [2] Soft Rough Approximation Operators on a Complete Atomic Boolean Lattice
    Mustafa, Heba I.
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [3] Rough approximations on a complete completely distributive lattice with applications to generalized rough sets
    Degang, Chen
    Wenxiu, Zhang
    Yeung, Daniel
    Tsang, E. C. C.
    INFORMATION SCIENCES, 2006, 176 (13) : 1829 - 1848
  • [4] Rough approximations via ideal on a complete completely distributive lattice
    Hongxia Han
    Qingguo Li
    Lankun Guo
    Soft Computing, 2016, 20 : 1853 - 1861
  • [5] Rough approximations via ideal on a complete completely distributive lattice
    Han, Hongxia
    Li, Qingguo
    Guo, Lankun
    SOFT COMPUTING, 2016, 20 (05) : 1853 - 1861
  • [6] The approximations in rough concept lattice and approximable concept lattice
    Xiao, Qimei
    Lang, Guangming
    Liu, Wenjun
    Cai, Mingjie
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2017, 33 (06) : 3459 - 3467
  • [7] LATTICE OF COMPLETE BOOLEAN ALGEBRAS IS COMPLEMENTED
    RAYBURN, MC
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1969, 16 (01): : 149 - &
  • [8] Rough Approximation Operators on a Complete Orthomodular Lattice
    Dai, Songsong
    AXIOMS, 2021, 10 (03)
  • [9] Efficient parallel boolean matrix based algorithms for computing composite rough set approximations
    Zhang, Junbo
    Zhu, Yun
    Pan, Yi
    Li, Tianrui
    INFORMATION SCIENCES, 2016, 329 : 287 - 302
  • [10] Rough sets based on complete completely distributive lattice
    Zhou, Ning Lin
    Hu, Bao Qing
    INFORMATION SCIENCES, 2014, 269 : 378 - 387
12345