Title of article
Heyting algebras with Boolean operators for rough sets and information retrieval applications Original Research Article
Author/Authors
Eric SanJuan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
17
From page
967
To page
983
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
Many-valued logics , Rough sets , Information retrieval , Query expansion , Implicative relations , Heyting algebras
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886709
Link To Document