Abstract
In this paper we consider many approximation spaces for rough theories, all of which are concrete realizations of an abstract structure stronger than the one introduced in [2] and defined in the following way:
where:
-
1.
〈Σ, ∧. ∨, 0, 1〉 is a complete lattice with respect to the partial order relation ≤, bounded by the least element 0 \( (\forall x \in \Sigma ,0 \leqslant x) \) and the greatest element 1 \( (\forall x \in \Sigma ,x \leqslant 1) \); elements from Σ are interpreted as concepts, data, etc., and are said to be approximable elements;
-
2.
\( \mathcal{D}(\Sigma ) \) is a sublattice of Σ whose elements are called definable;
and satisfying the following axioms:
-
(Ax1):
For any approximable element x ∈ Σ, there exists (at least) one element i(x) such that:
$$ i(x) \in \mathcal{D}(\Sigma ) $$((1.1a))$$ i(x) \leqslant x $$((1.1b))$$ \forall \alpha \in \mathcal{D}(\Sigma ), (\alpha \leqslant x \Rightarrow \alpha \leqslant i(x)) $$((1.1c)) -
(Ax2):
For any approximable element x ∈ Σ, there exists (at least) one element o(x) such that:
$$ o(x) \in \mathcal{D}(\Sigma ) $$((1.2a))$$ x \leqslant o(x) $$((1.2b))$$ \forall \gamma \in \mathcal{D}(\Sigma ), (x \leqslant \gamma \Rightarrow o(x) \leqslant \gamma ) $$((1.2c))i.e., i(x) [resp., o(x)] is the best approximation of the “vague” element x from the bottom [resp., top] by definable elements.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Bezdek and J. Harris, Fuzzy partitions and relations: an axiomatic basis for clustering, Fuzzy Sets and Systems, 1 (1978), pp. 112–127.
G. Cattaneo, Abstract approximation spaces for rough theories, in Rough Sets in Data Mining and Knowledge Discovery, L. Polkowski and A. Skowron, eds., Soft Computing Series, Physica Verlag, Springer, Berlin, 1998, ch. 4, pp. 1–40. in print.
G. Cattaneo, M. L. D. Chiara, and R. Giuntini, Some algebraic structures for many-valued logics. accepted in Tatra Mountains Mathematical Publication, 1998.
G. Cattaneo, R. Giuntini, and R. Pilla, BZMVdMand Stonian MV algebras (applications to fuzzy sets and rough approximations). in print in Fuzzy Sets Syst., 1998.
G. Cattaneo and G. Marino, Brouwer-Zadeh posets and fuzzy set theory, in Proceedings of the 1st Napoli Meeting on Fuzzy Systems, A. D. Nola and A. Ventre, eds., Napoli, June 1984, pp. 34–58.
G. Cattaneo and G. Nisticò, Brouwer-Zadeh posets and three valued Lukasiewicz posets, Fuzzy Sets Syst., 33 (1989), pp. 165–190.
C. C. Chang, Algebraic analysis of many valued logics, Trans. Amer. Math. Soc., 88 (1958), pp. 467–490.
_____, A new proof of the completeness of the Lukasiewicz axioms, Trans. Amer. Math. Soc., 95 (1959), pp. 74–80.
Z. Pawlak, Information systems-theoretical foundations, Information Systems, 6 (1981), pp. 205–218.
_____, Rough sets, Internat. J. Inform. Comput. Sci., 11 (1982), pp. 341–356.
_____, Rough sets: A new approach to vagueness, in Fuzzy Logic for the Management of Uncertainty, L. A. Zadeh and J. Kacprzyc, eds., J. Wiley and Sons, New York, 1992, pp. 105–118.
N. Rescher, Many-valued Logic, Mc Graw-Hill, New York, 1969.
D. Vakarelov, A modal logic for similarity relations in Pawlak knowledge representation systems, Fundamenta Informaticae, XV (1991), pp. 61–79.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cattaneo, G. (1998). Fuzzy Extension of Rough Sets Theory. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_38
Download citation
DOI: https://doi.org/10.1007/3-540-69115-4_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64655-6
Online ISBN: 978-3-540-69115-0
eBook Packages: Springer Book Archive