首页 | 本学科首页   官方微博 | 高级检索  
     


Heyting algebras with Boolean operators for rough sets and information retrieval applications
Authors:Eric SanJuan
Affiliation:LIA, Université d’Avignon et des pays du Vaucluse, 339 chemin des Meinajariès, BP1228, 84911 Avignon Cedex 9, France
Abstract:This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of rough set concepts in particular. We argue that these generalizations are suitable for modeling relevance of documents in an information retrieval system.
Keywords:Heyting algebras   Many-valued logics   Rough sets   Information retrieval   Query expansion   Implicative relations
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号