Fuzzy equations max-\(\ast\) with conditionally cancellative operations (Q713422): Difference between revisions

Fuzzy systems of equations of the form \(A \circ x = b\) are studied, where \(A \in [0, 1]^{m \times n}\), \(b \in [0, 1]^m\) are given, and \(x \in [0,1]^n\) is unknown. \(\circ\) denotes the max-\(\ast\) composition defined as \((A \circ x)_i = \bigvee_{j=1}^n(a_{ij} \ast x_j)\), \(i = 1, \ldots, m\), and \(\ast\) is a binary operation on \([0, 1]\). If \(\ast\) is a continuous, strictly increasing triangular norm, then non-zero coordinates of minimal solutions are coordinates of the greatest solution, as shown in [\textit{B. S. Shieh}, Inf. Sci. 177, No. 19, 4208--4215 (2007; Zbl 1122.03054)]. In this paper it is shown that the weakest assumption on the operation \(\ast\) to guarantee such a result is that \(\ast\) is an increasing operation which is left continuous on the second argument, left conditionally cancellative and satisfies \(1 \ast 0 = 0\). It is demonstrated that these conditions delimit a rich family of operations. An algorithm for the determination of the family of all minimal solutions of the above system of equations is also presented.