Heyting algebras with Boolean operators for rough sets and information retrieval applications

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. Key words: Heyting algebras, Many Valued Logics, Rough Sets, Information Retrieval, Query Expansion, Implicative relations.

• Type: Journal
• Year: 2008
• Where: DAM
• Authors: Eric SanJuan
• Keywords: Boolean Algebras, DAM 2008, Information Retrieval, Rough Sets