Construction Of T-norms Article Index for
Construction Of
Website Links For
Construction
 

Information About

Construction Of T-norms




Relevant background can be found in the article on T-norm s.


GENERATORS OF T-NORMS


The method of constructing t-norms by generators consists in using a unary function (''generator'') to transform some known binary function (most often, addition or multiplication) into a t-norm.

In order to allow using non-bijective generators, which do not have the Inverse Function , the following notion of ''pseudo-inverse function'' is employed:
:Let ''f'': → [''c'', ''d'' be a monotone function between two closed subintervals of Extended Real Line . The ''pseudo-inverse function'' to ''f'' is the function ''f'' (−1): → [''a'', ''b'' defined as
::f^{(-1)}(y) = \begin{cases}
\sup \{ x\in {Link without Title} \mid f(x) < y \} & \mbox{for } f \mbox{ non-decreasing} \
\sup \{ x\in {Link without Title} \mid f(x) > y \} & \mbox{for } f \mbox{ non-increasing.}
\end{cases}


Additive generators


The construction of t-norms by additive generators is based on the following theorem:
: Let ''f'': → [0, +∞ be a strictly decreasing function such that ''f''(1) = 0 and ''f''(''x'') + ''f''(''y'') is in the range of ''f'' or equal to ''f''(0+) or +∞ for all ''x'', ''y'' in Then the function ''T'': [0, 1 2 → [0, 1] defined as
::''T''(''x'', ''y'') = ''f'' (-1)(''f''(''x'') + ''f''(''y''))
: is a t-norm.

If a t-norm ''T'' results from the latter construction by a function ''f'' which is right-continuous in 0, then ''f'' is called an ''additive generator'' of ''T''.

Examples:
  • The function ''f''(''x'') = 1 – ''x'' for ''x'' in {Link without Title} is an additive generator of the Łukasiewicz t-norm.

  • The function ''f'' defined as ''f''(''x'') = –log(''x'') if 0 < ''x'' ≤ 1 and ''f''(0) = +∞ is an additive generator of the product t-norm.

  • The function ''f'' defined as ''f''(''x'') = 2 – ''x'' if 0 ≤ ''x'' < 1 and ''f''(1) = 0 is an additive generator of the drastic t-norm.


Basic properties of additive generators are summarized by the following theorem:
:Let ''f'': → [0, +∞ be an additive generator of a t-norm ''T''. Then:
  • ''T'' is an Archimedean t-norm.

  • ''T'' is continuous if and only if ''f'' is continuous.

  • ''T'' is strictly monotone if and only if ''f''(0) = +∞.

  • Each element of (0, 1) is a nilpotent element of ''T'' if and only if f(0) < +∞.

  • The multiple of ''f'' by a positive constant is also an additive generator of ''T''.

  • ''T'' has no non-trivial idempotents. (Consequently, e.g., the minimum t-norm has no additive generator.)



Multiplicative generators


The isomorphism between addition on and multiplication on [0, 1 by the logarithm and the exponential function allow two-way transformations between additive and multiplicative generators of a t-norm. If ''f'' is an additive generator of a t-norm ''T'', then the function ''g'': → [0, 1 defined as ''g''(''x'') = e−''f'' (''x'') is a ''multiplicative generator'' of ''T'', that is, a function ''h'' such that
  • ''h'' is strictly increasing

  • ''h''(1) = 1

  • ''h''(''x'') · ''h''(''y'') is in the range of ''h'' or equal to 0 or ''h''(0+) for all ''x'', ''y'' in {Link without Title}

  • ''h'' is right-continuous in 0

  • ''T''(''x'', ''y'') = ''h'' (−1)(''h''(''x'') · ''h''(''y'')).

  • Vice versa, if ''g'' is a multiplicative generator of ''T'', then ''f'': → [0, +∞ defined by ''f''(''x'') = −log(''g''(x)) is an additive generator of ''T''.



PARAMETRIC CLASSES OF T-NORMS


Many families of related t-norms can be defined by an explicit formula depending on a parameter ''p''. This section lists the best known parameterized families of t-norms. The following definitions will be used in the list:

  • A family of t-norms ''T''''p'' parameterized by ''p'' is ''increasing'' if ''T''''p'' ≤ ''T''''q'' for all ''x'', ''y'' in {Link without Title} whenever ''p'' ≤ ''q'' (similarly for ''decreasing'' and ''strictly'' increasing or decreasing).


  • A family of t-norms ''T''''p'' is ''continuous'' with respect to the parameter ''p'' if

  • ::\lim_{p o p_0} T_p = T_{p_0}

:for all values ''p''0 of the parameter.


Schweizer–Sklar t-norms


The family of ''Schweizer–Sklar t-norms'', introduced by Berthold Schweizer and Abe Sklar in the early 1960s, is given by the parametric definition
:T^{\mathrm{SS}}_p(x,y) = \begin{cases}
T_{\mathrm{min}}(x,y) & \mbox{if } p = -\infty \
(x^p + y^p - 1)^{1/p} & \mbox{if } -\infty < p < 0 \
T_{\mathrm{prod}}(x,y) & \mbox{if } p = 0 \
(\max(0, x^p + y^p - 1))^{1/p} & \mbox{if } 0 < p < +\infty \
T_{\mathrm{D}}(x,y) & \mbox{if } p = +\infty.
\end{cases}

A Schweizer–Sklar t-norm T^{\mathrm{SS}}_p is
  • Archimedean if and only if ''p'' > −∞

  • Continuous if and only if ''p'' < +∞

  • Strict if and only if −∞ < ''p'' ≤ 0 (for ''p'' = −1 it is the Hamacher product)

  • Nilpotent if and only if 0 < ''p'' < +∞ (for ''p'' = 1 it is the Łukasiewicz t-norm).

  • The family is strictly decreasing for ''p'' ≥ 0 and continuous with respect to ''p'' in {Link without Title} . An additive generator for T^{\mathrm{SS}}_p for −∞ < ''p'' < +∞ is

:f^{\mathrm{SS}}_p (x,y) = \begin{cases}
-\log x & \mbox{if } p = 0 \
rac{1 - x^p}{p} & \mbox{otherwise.}
\end{cases}


Hamacher t-norms


The family of ''Hamacher t-norms'', introduced by Horst Hamacher in the late 1970s, is given by the following parametric definition for 0 ≤ ''p'' ≤ +∞:
:T^{\mathrm{H}}_p (x,y) = \begin{cases}
T_{\mathrm{D}}(x,y) & \mbox{if } p = +\infty \
0 & \mbox{if } p = x = y = 0 \
rac{xy}{p + (1 - p)(x + y - xy)} & \mbox{otherwise.}
\end{cases}
The t-norm T^{\mathrm{H}}_0 is called the ''Hamacher product.''

Hamacher t-norms are the only t-norms which are rational functions.
The Hamacher t-norm T^{\mathrm{H}}_p is strict if and only if ''p'' < +∞ (for ''p'' = 1 it is the product t-norm). The family is strictly decreasing and continuous with respect to ''p''. An additive generator of T^{\mathrm{H}}_p for ''p'' < +∞ is
:f^{\mathrm{H}}_p(x) = \begin{cases}
rac{1 - x}{x} & \mbox{if } p = 0 \
\log rac{p + (1 - p)x}{x} & \mbox{otherwise.}
\end{cases}


Frank t-norms


The family of ''Frank t-norms'', introduced by M.J. Frank in the late 1970s, is given by the parametric definition for 0 ≤ ''p'' ≤ +∞ as follows:
:T^{\mathrm{F}}_p(x,y) = \begin{cases}
T_{\mathrm{min}}(x,y) & \mbox{if } p = 0 \
T_{\mathrm{prod}}(x,y) & \mbox{if } p = 1 \
T_{\mathrm{Luk}}(x,y) & \mbox{if } p = +\infty \
\log_p\left(1 + rac{(p^x - 1)(p^y - 1)}{p - 1} ight) & \mbox{otherwise.}
\end{cases}

The Frank t-norm T^{\mathrm{F}}_p is strict if ''p'' < +∞. The family is strictly decreasing and continuous with respect to ''p''. An additive generator for T^{\mathrm{F}}_p is
:f^{\mathrm{F}}_p(x,y) = \begin{cases}
-\log x & \mbox{if } p = 1 \
1 - x & \mbox{if } p = +\infty \
\log rac{p - 1}{p^x - 1} & \mbox{otherwise.}
\end{cases}



Yager t-norms


The family of ''Yager t-norms'', introduced in the early 1980s by Ronald R. Yager, is given for 0 ≤ ''p'' ≤ +∞ by
:T^{\mathrm{Y}}_p (x,y) = \begin{cases}
T_{\mathrm{D}}(x,y) & \mbox{if } p = 0 \
\max\left(0, 1 - ((1 - x)^p + (1 - y)^p)^{1/p} ight) & \mbox{if } 0 < p < +\infty \
T_{\mathrm{min}}(x,y) & \mbox{if } p = +\infty
\end{cases}


The Yager t-norm T^{\mathrm{Y}}_p is nilpotent if and only if 0 < ''p'' < +∞ (for ''p'' = 1 it is the Łukasiewicz t-norm). The family is strictly increasing and continuous with respect to ''p''. The Yager t-norm T^{\mathrm{Y}}_p for 0 < ''p'' < +∞ arises from the Łukasiewicz t-norm by raising its additive generator to the power of ''p''. An additive generator of T^{\mathrm{Y}}_p for 0 < ''p'' < +∞ is
:f^{\mathrm{Y}}_p(x) = (1 - x)^p.


Aczél–Alsina t-norms


The family of ''Aczél–Alsina t-norms'', introduced in the early 1980s by János Aczél and Claudi Alsina, is given for 0 ≤ ''p'' ≤ +∞ by
:T^{\mathrm{AA}}_p (x,y) = \begin{cases}
T_{\mathrm{D}}(x,y) & \mbox{if } p = 0 \


\end{cases}

The Aczél–Alsina t-norm T^{\mathrm{AA}}_p is strict if and only if 0 < ''p'' < +∞ (for ''p'' = 1 it is the product t-norm). The family is strictly increasing and continuous with respect to ''p''. The Aczél–Alsina t-norm T^{\mathrm{AA}}_p for 0 < ''p'' < +∞ arises from the product t-norm by raising its additive generator to the power of ''p''. An additive generator of T^{\mathrm{AA}}_p for 0 < ''p'' < +∞ is
:f^{\mathrm{AA}}_p(x) = (-\log x)^p.


Dombi t-norms


The family of ''Dombi t-norms'', introduced by József Dombi (1982), is given for 0 ≤ ''p'' ≤ +∞ by
:T^{\mathrm{D}}_p (x,y) = \begin{cases}
0 & \mbox{if } x = 0 \mbox{ or } y = 0 \
T_{\mathrm{D}}(x,y) & \mbox{if } p = 0 \
T_{\mathrm{min}}(x,y) & \mbox{if } p = +\infty \
rac{1}{1 + \left(
\left( rac{1 - x}{x} ight)^p + \left( rac{1 - y}{y} ight)^p
ight)^{1/p}} & \mbox{otherwise.} \
\end{cases}


The Dombi t-norm T^{\mathrm{D}}_p is strict if and only if 0 < ''p'' < +∞ (for ''p'' = 1 it is the Hamacher product). The family is strictly increasing and continuous with respect to ''p''. The Dombi t-norm T^{\mathrm{D}}_p for 0 < ''p'' < +∞ arises from the Hamacher product t-norm by raising its additive generator to the power of ''p''. An additive generator of T^{\mathrm{D}}_p for 0 < ''p'' < +∞ is
:f^{\mathrm{D}}_p(x) = \left( rac{1-x}{x} ight)^p.


Sugeno–Weber t-norms


The family of ''Sugeno–Weber t-norms'' was introduced in the early 1980s by Siegfried Weber; the dual T-conorm s were defined already in the early 1970s by Michio Sugeno. It is given for −1 ≤ ''p'' ≤ +∞ by
:T^{\mathrm{SW}}_p (x,y) = \begin{cases}
T_{\mathrm{D}}(x,y) & \mbox{if } p = -1 \
\max\left(0, rac{x + y - 1 + pxy}{1 + p} ight) & \mbox{if } -1 < p < +\infty \
T_{\mathrm{prod}}(x,y) & \mbox{if } p = +\infty
\end{cases}


The Sugeno–Weber t-norm T^{\mathrm{SW}}_p is nilpotent if and only if −1 < ''p'' < +∞ (for ''p'' = 0 it is the Łukasiewicz t-norm). The family is strictly increasing and continuous with respect to ''p''. An additive generator of T^{\mathrm{SW}}_p for 0 < ''p'' < +∞ {Link without Title} is
:f^{\mathrm{SW}}_p(x) = \begin{cases}
1 - x & \mbox{if } p = 0 \
1 - \log_{1 + p}(1 + px) & \mbox{otherwise.}
\end{cases}


ORDINAL SUMS


The Ordinal Sum constructs a t-norm from a family of t-norms, by shrinking them into disjoint subintervals of the interval {Link without Title} and completing the t-norm by using the minimum on the rest of the unit square. It is based on the following theorem:

:Let ''T''''i'' for ''i'' in an index set ''I'' be a family of t-norms and (''a''''i'', ''b''''i'') a family of pairwise disjoint (non-empty) open subintervals of Then the function ''T'': [0, 1 2 → [0, 1] defined as
::T(x, y) = \begin{cases}
a_i + (b_i - a_i) \cdot T_i\left( rac{x - a_i}{b_i - a_i}, rac{y - a_i}{b_i - a_i} ight)
& \mbox{if } x, y \in b_i ^2 \
\min(x, y) & \mbox{otherwise}
\end{cases}
:is a t-norm.

]
The resulting t-norm is called the ''ordinal sum'' of the summands (''T''i, ''a''i, ''b''i) for ''i'' in ''I'', denoted by
:T = \bigoplus
olimits_{i\in I} (T_i, a_i, b_i),
or (T_1, a_1, b_1) \oplus \dots \oplus (T_n, a_n, b_n) if ''I'' is finite.

Ordinal sums of t-norms enjoy the following properties:







If T = \bigoplus
olimits_{i\in I} (T_i, a_i, b_i) is a left-continuous t-norm, then its residuum ''R'' is given as follows:
:R(x, y) = \begin{cases}
1 & \mbox{if } x \le y \
a_i + (b_i - a_i) \cdot R_i\left( rac{x - a_i}{b_i - a_i}, rac{y - a_i}{b_i - a_i} ight)
& \mbox{if } a_i < y < x \le b_i \
y & \mbox{otherwise.}
\end{cases}
where ''R''i is the residuum of ''T''i, for each ''i'' in ''I''.


Ordinal sums of continuous t-norms


The ordinal sum of a family of continuous t-norms is a continuous t-norm. By the Mostert–Shields theorem, every continuous t-norm is expressible as the ordinal sum of Archimedean continuous t-norms. Since the latter are either nilpotent (and then isomorphic to the Łukasiewicz t-norm) or strict (then isomorphic to the product t-norm), each continuous t-norm is isomorphic to the ordinal sum of Łukasiewicz and product t-norms.

Important examples of ordinal sums of continuous t-norms are the following ones:




ROTATIONS


The construction of t-norms by rotation was introduced by Sándor Jenei (2000). It is based on the following theorem:
:Let ''T'' be a left-continuous t-norm without Zero Divisor s, ''N'': → [0, 1 the function that assigns 1 − ''x'' to ''x'' and ''t'' = 0.5. Let ''T''1 be the linear transformation of ''T'' into [''t'', 1] and R_{T_1}(x,y) = \sup\{z \mid T_1(z,x)\le y\}. Then the function
::T_{\mathrm{rot}} = \begin{cases}
T_1(x, y) & \mbox{if } x, y \in (t, 1] \
N(R_{T_1}(x, N(y))) & \mbox{if } x \in (t, 1] \mbox{ and } y \in t \
N(R_{T_1}(y, N(x))) & \mbox{if } x \in t \mbox{ and } y \in (t, 1] \
0 & \mbox{if } x, y \in t
\end{cases}
:is a left-continuous t-norm, called the ''rotation'' of the t-norm ''T''.

Geometrically, the construction can be described as first shrinking the t-norm ''T'' to the interval {Link without Title} and then rotating it by the angle 2π/3 in both directions around the line connecting the points (0, 0, 1) and (1, 1, 0).

The theorem can be generalized by taking for ''N'' any ''strong negation'', that is, an Involutive strictly decreasing continuous function on {Link without Title} , and for ''t'' taking the unique Fixed Point of ''N''.

The resulting t-norm enjoys the following ''rotation invariance'' property with respect to ''N'':
T

The negation induced by ''T''rot is the function ''N'', that is, ''N''(''x'') = ''R''rot(''x'', 0) for all ''x'', where ''R''rot is the residuum of ''T''rot.


SEE ALSO




REFERENCES