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

Authors:
Eric SanJuan
Affiliations:
LIA, Université d'Avignon et des pays du Vaucluse, 339 chemin des Meinajariès, BP1228, 84911 Avignon Cedex 9, France
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 7
Cited 0

Variable precision rough set model

Journal of Computer and System Sciences
A probabilistic terminological logic for modelling information retrieval

SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
A rough set model of information retrieval

Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
A logic for rough sets

Theoretical Computer Science
The lattice theory of r-ordered partitions

Discrete Mathematics
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Modern Information Retrieval

Modern Information Retrieval

Quantified Score

Hi-index	0.04

Visualization

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.