https://inria.hal.science/hal-01524971Wei, QianjinQianjinWeiSEE - School of Electronic Engineering [Xidian University] - Xidian UniversityGuangxi Key Laboratory of Trusted Software - Guilin University of Electronic TechnologyGu, TianlongTianlongGuGuangxi Key Laboratory of Trusted Software - Guilin University of Electronic TechnologyLi, FengyingFengyingLiGuangxi Key Laboratory of Trusted Software - Guilin University of Electronic TechnologyCai, GuoyongGuoyongCaiGuangxi Key Laboratory of Trusted Software - Guilin University of Electronic TechnologyThe Representation of Indiscernibility Relation Using ZBDDsHAL CCSD2012rough setIndiscernibility relationZero-Suppressed BDDs[INFO] Computer Science [cs]Ifip, HalZhongzhi ShiDavid LeakeSunil Vadera2017-05-19 10:43:282021-12-15 12:42:022017-05-19 10:45:56enConference papershttps://inria.hal.science/hal-01524971/document10.1007/978-3-642-32891-6_28application/pdf1The indiscernibility relation is the basic concept in Rough set theory, a novel representation of indiscernibility relation using Zero-Suppressed BDDs is proposed in this paper. Through introducing the indiscernibility matrix and the indiscernibility graph, we put forward the encoding of the variable and give the characteristic function. Once the characteristic function is constructed, it can be represented using ZBDDs.And further, combined with an example, we analyze the effectiveness of this method. It provides a basis for deal with rough set computing.