Abstract
In this Ch., we solve a decomposition problem, more complicated than the problem mentioned in Sec.6.5, and precisely, we present a numerical algorithm, illustrated by a flowchart, which assures the existence of a fuzzy relation Z∈F(X×X) such that Z⊙Z=R, where R∈F(X×X) is an assigned fuzzy relation defined on a referential set X and assuming values in a linear lattice L with universal bounds 0 and 1. Connections with results already existing in recent literature are also given.
This is a preview of subscription content, log in via an institution to check access.
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
A. Di Nola, W. Pedrycz and S. Sessa, Decomposition problem of fuzzy relations, Internat. J. Gen. Syst. 10 (1985), 123 - 133.
A. Di Nola, W. Pedrycz, S. Sessa and M. Higashi, Minimal and maximal solutions of a decomposition problem of fuzzy relations, Internat. J. Gen. Syst. 11 (1985), 103 - 116.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
di Nola, A., Sessa, S., Pedrycz, W., Sanchez, E. (1989). Max-Min Decomposition Problem of a Fuzzy Relation in Linear Lattices. In: Fuzzy Relation Equations and Their Applications to Knowledge Engineering. Theory and Decision Library, vol 3. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1650-5_7
Download citation
DOI: https://doi.org/10.1007/978-94-017-1650-5_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4050-3
Online ISBN: 978-94-017-1650-5
eBook Packages: Springer Book Archive