摘要
首先证明了加细?是集合U的划分全体?(U)上的偏序,讨论了划分的加细与划分的划分之间的联系。然后,U上的等价关系全体E(U)是格,偏序结构(E(U),?)与(?(U),?)同构,由此得到划分格?(U)。最后介绍了划分格在信息系统、知识库和粒计算中的应用。
It proves that refinement?is a partial ordering over the set?(U ) of all partitions of a setU, and some relationships between refinement of partition and partition of partition are discussed. Then, because the setE(U ) of all equivalence relations overU form a lattice, and two partial ordering sets (E(U ) ,? ) and (?(U ) ,?) are isomorphic,?(U ) is also a lattice, i.e. partition lattice. Finally, some applications of partition lattice in information system, knowl-edge base and granular computing are introduced.
出处
《软件》
2015年第9期42-44,共3页
Software
基金
湖北省自然科学基金(2014CFB535)
湖北省教育厅科学技术研究重点项目(D20131005)
关键词
划分
偏序
格
信息系统
知识库
粒计算
Partition
Partial ordering
Lattice
information system
Knowledge base
Granular computing
