Rough mereology as a link between rough and fuzzy set theories. A survey

8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we discuss rough inclusions defined in Rough Mereology - a paradigm for approximate reasoning introduced by Polkowski and Skowron - as a basis for common models for rough as well as fuzzy set theories. We justify the point of view that tolerance (or, similarity) is the motif common to both theories. To this end, we demonstrate in Sect. 6 that rough inclusions (which represent a hierarchy of tolerance relations) induce rough set theoretic approximations as well as partitions and equivalence relations in the sense of fuzzy set theory. Before that, we include an account of mereological theory in Sect. 3. We also discuss granulation mechanisms based on rough inclusions with an outline of applications to rough-fuzzy-neurocomputing and computing with words in Sects. 4 and 5. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Polkowski, L. (2004). Rough mereology as a link between rough and fuzzy set theories. A survey. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3135, 253–277. https://doi.org/10.1007/978-3-540-27778-1_13

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