...
首页> 外文期刊>Fundamenta Informaticae >Rough Set Algebras As Description Domains
【24h】

Rough Set Algebras As Description Domains

机译:粗糙集代数作为描述域

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Study of the so called knowledge ordering of rough sets was initiated by V. W. Marek and M. Truszczynski at the end of 90-ies. Under this ordering, the rough sets of a fixed approximation space form a domain in which every set ↓a is a Boolean algebra. In the paper, an additional operation inversion on rough set domains is introduced and an abstract axiomatic description of obtained algebras of rough set is given. It is shown that the resulting class of algebras is essentially different from those traditional in rough set theory: it is not definable, for instance, in the class of regular double Stone algebras, and conversely.
机译:V. W. Marek和M. Truszczynski在90年代末开始了对所谓粗糙集知识排序的研究。在这种排序下,固定逼近空间的粗糙集形成一个域,其中每个集合↓a是一个布尔代数。本文介绍了在粗糙集域上的附加运算反演,并给出了获得的粗糙集代数的抽象公理描述。结果表明,所得的代数类别与粗糙集理论中的传统代数实质上不同:例如,在规则双斯通代数类别中,它是不可定义的,反之亦然。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号