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

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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. © 2007 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

SanJuan, E. (2008). Heyting algebras with Boolean operators for rough sets and information retrieval applications. Discrete Applied Mathematics, 156(6), 967–983. https://doi.org/10.1016/j.dam.2007.08.050

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free