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

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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01320304
Contributor : Bibliothèque Universitaire Déposants Hal-Avignon <>
Submitted on : Monday, May 23, 2016 - 4:15:30 PM
Last modification on : Saturday, March 23, 2019 - 1:22:30 AM

Links full text

Identifiers

Collections

Citation

Eric Sanjuan. Heyting algebras with Boolean operators for rough sets and information retrieval applications. Discrete Applied Mathematics, Elsevier, 2008, ⟨10.1016/j.dam.2007.08.050⟩. ⟨hal-01320304⟩

Share

Metrics

Record views

123