A NOTE ON “DECOMPOSITION PROBLEM OF FUZZY RELATIONS” (Q4525889)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1556334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A NOTE ON “DECOMPOSITION PROBLEM OF FUZZY RELATIONS” |
scientific article; zbMATH DE number 1556334 |
Statements
A NOTE ON “DECOMPOSITION PROBLEM OF FUZZY RELATIONS” (English)
0 references
15 December 2002
0 references
decomposition algorithm
0 references
max-min composition of fuzzy relations
0 references
decomposition of a fuzzy relation
0 references
square root of a Boolean matrix
0 references
0 references
0.80013525
0 references
0.76743025
0 references
0.76734626
0 references
0.75424415
0 references
0.7528666
0 references
0.74395657
0 references
0.74327534
0 references
0.74134046
0 references
The aim of this paper is to point out a correction to the algorithm of [(*) \textit{A. Di Nola}, \textit{S. Sessa}, and \textit{W. Pedrycz}, Int. J. Gen. Syst. 10, 123-133 (1985; Zbl 0559.04004)] that solves the decomposition problem of a fuzzy relation (DPFR). DPFR can be stated as follows: Let \(X\) be a finite set, \(L\) a linear lattice with universal bounds 0 and 1, and consider \(F(X\times X)=\{R\mid R:X \times X\to L\}\) to be the set of all fuzzy relations defined on \(X\times X\). Then the DPFR can be stated as follows: given \(R\in F(X\times X)\), determine whether there exists \(Z\in F(X\times X)\) such that \(R=Z\otimes Z\), where ``\(\otimes\)'' represents the max-min (fuzzy) composition of two fuzzy relations. For the case when \(R\) is a Boolean matrix, the DPFR becomes the problem of finding the square root of a Boolean matrix, which is a well-known unsolved problem. In [(*)], the DPFR is solved theoretically, a numerical algorithm is proposed, and the algorithm is illustrated by an execution flowchart. The author of this note shows an error of the DPFR flowchart, gives the correct flowchart, and verifies the corrected DPFR algorithm flowchart on a numerical (counter-)example.
0 references