Weak and graded properties of fuzzy relations in the context of aggregation process (Q2269186): Difference between revisions

Fuzzy relations (orders, equivalences, etc.) are defined in terms of the classical Boolean logic, based on properties like reflexivity, symmetry, antisymmetry, transitivity (mostly \(T\)-transitivity with \(T\) a triangular norm), etc. This paper deals with a concept of graded properties of fuzzy relations, based on a threshold \(\alpha\) and thus called \(\alpha\)-properties. When aggregaating two or more fuzzy relations, it is important to see which properties are preserved by this aggregation. The author characterizes aggregation functions preserving single graded properties for a fixed threshold \(\alpha\). So, for example, \(\alpha\)-symmetry is preserved by an \(n\)-ary function \(F: [0,1]^n\to [0,1]\) whenever \(F(x_1,\dots, x_n)\geq 1-\alpha\) can be satisfied only if \(x_i\geq 1-\alpha\) for \(i= 1,\dots, n\). Similar considerations are done in the case of so-called weak properties introduced in [\textit{J. Drewniak}, Fuzzy relation calculus. Prace Naukowe Uniwersytetu Śląskiego w Katowicach, 1063. Katowice: Uniwersytet Śląski (1989; Zbl 0701.04002)]. Note that in some cases, weak properties can be seen as \(\alpha\)-properties with \(\alpha= 0\) (this is, e.g., the case of weak symmetry). Functions preserving special weak fuzzy relations (weak tolerance, weak tournament, weak equivalence, etc.) are given, mostly characterized by sufficient conditions only. Several examples are included.