Misplaced Pages

Construction of t-norms

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Mathematics
This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (February 2012) (Learn how and when to remove this message)

In mathematics, t-norms are a special kind of binary operations on the real unit interval . Various constructions of t-norms, either by explicit definition or by transformation from previously known functions, provide a plenitude of examples and classes of t-norms. This is important, e.g., for finding counter-examples or supplying t-norms with particular properties for use in engineering applications of fuzzy logic. The main ways of construction of t-norms include using generators, defining parametric classes of t-norms, rotations, or ordinal sums of t-norms.

Relevant background can be found in the article on t-norms.

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: → be a monotone function between two closed subintervals of extended real line. The pseudo-inverse function to f is the function f : → defined as
f ( 1 ) ( y ) = { sup { x [ a , b ] f ( x ) < y } for  f  non-decreasing sup { x [ a , b ] f ( x ) > y } for  f  non-increasing. {\displaystyle f^{(-1)}(y)={\begin{cases}\sup\{x\in \mid f(x)<y\}&{\text{for }}f{\text{ non-decreasing}}\\\sup\{x\in \mid f(x)>y\}&{\text{for }}f{\text{ non-increasing.}}\end{cases}}}

Additive generators

The construction of t-norms by additive generators is based on the following theorem:

Let f: → 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: → defined as
T(x, y) = f (f(x) + f(y))
is a t-norm.

Alternatively, one may avoid using the notion of pseudo-inverse function by having T ( x , y ) = f 1 ( min ( f ( 0 + ) , f ( x ) + f ( y ) ) ) {\displaystyle T(x,y)=f^{-1}\left(\min \left(f(0^{+}),f(x)+f(y)\right)\right)} . The corresponding residuum can then be expressed as ( x y ) = f 1 ( max ( 0 , f ( y ) f ( x ) ) ) {\displaystyle (x\Rightarrow y)=f^{-1}\left(\max \left(0,f(y)-f(x)\right)\right)} . And the biresiduum as ( x y ) = f 1 ( | f ( x ) f ( y ) | ) {\displaystyle (x\Leftrightarrow y)=f^{-1}\left(\left|f(x)-f(y)\right|\right)} .

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 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: → 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 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 h: → defined as h(x) = e 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
  • h is right-continuous in 0
  • T(x, y) = h (h(x) · h(y)).

Vice versa, if h is a multiplicative generator of T, then f: → defined by f(x) = −log(h(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 Tp parameterized by p is increasing if Tp(x, y) ≤ Tq(x, y) for all x, y in whenever pq (similarly for decreasing and strictly increasing or decreasing).
  • A family of t-norms Tp is continuous with respect to the parameter p if
lim p p 0 T p = T p 0 {\displaystyle \lim _{p\to p_{0}}T_{p}=T_{p_{0}}}
for all values p0 of the parameter.

Schweizer–Sklar t-norms

Graph (3D and contours) of the Schweizer–Sklar t-norm with p = 2

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 p S S ( x , y ) = { T min ( x , y ) if  p = ( x p + y p 1 ) 1 / p if  < p < 0 T p r o d ( x , y ) if  p = 0 ( max ( 0 , x p + y p 1 ) ) 1 / p if  0 < p < + T D ( x , y ) if  p = + . {\displaystyle T_{p}^{\mathrm {SS} }(x,y)={\begin{cases}T_{\min }(x,y)&{\text{if }}p=-\infty \\(x^{p}+y^{p}-1)^{1/p}&{\text{if }}-\infty <p<0\\T_{\mathrm {prod} }(x,y)&{\text{if }}p=0\\(\max(0,x^{p}+y^{p}-1))^{1/p}&{\text{if }}0<p<+\infty \\T_{\mathrm {D} }(x,y)&{\text{if }}p=+\infty .\end{cases}}}

A Schweizer–Sklar t-norm T p S S {\displaystyle T_{p}^{\mathrm {SS} }} 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 . An additive generator for T p S S {\displaystyle T_{p}^{\mathrm {SS} }} for −∞ < p < +∞ is

f p S S ( x ) = { log x if  p = 0 1 x p p otherwise. {\displaystyle f_{p}^{\mathrm {SS} }(x)={\begin{cases}-\log x&{\text{if }}p=0\\{\frac {1-x^{p}}{p}}&{\text{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 p H ( x , y ) = { T D ( x , y ) if  p = + 0 if  p = x = y = 0 x y p + ( 1 p ) ( x + y x y ) otherwise. {\displaystyle T_{p}^{\mathrm {H} }(x,y)={\begin{cases}T_{\mathrm {D} }(x,y)&{\text{if }}p=+\infty \\0&{\text{if }}p=x=y=0\\{\frac {xy}{p+(1-p)(x+y-xy)}}&{\text{otherwise.}}\end{cases}}}

The t-norm T 0 H {\displaystyle T_{0}^{\mathrm {H} }} is called the Hamacher product.

Hamacher t-norms are the only t-norms which are rational functions. The Hamacher t-norm T p H {\displaystyle T_{p}^{\mathrm {H} }} 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 p H {\displaystyle T_{p}^{\mathrm {H} }} for p < +∞ is

f p H ( x ) = { 1 x x if  p = 0 log p + ( 1 p ) x x otherwise. {\displaystyle f_{p}^{\mathrm {H} }(x)={\begin{cases}{\frac {1-x}{x}}&{\text{if }}p=0\\\log {\frac {p+(1-p)x}{x}}&{\text{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 p F ( x , y ) = { T m i n ( x , y ) if  p = 0 T p r o d ( x , y ) if  p = 1 T L u k ( x , y ) if  p = + log p ( 1 + ( p x 1 ) ( p y 1 ) p 1 ) otherwise. {\displaystyle T_{p}^{\mathrm {F} }(x,y)={\begin{cases}T_{\mathrm {min} }(x,y)&{\text{if }}p=0\\T_{\mathrm {prod} }(x,y)&{\text{if }}p=1\\T_{\mathrm {Luk} }(x,y)&{\text{if }}p=+\infty \\\log _{p}\left(1+{\frac {(p^{x}-1)(p^{y}-1)}{p-1}}\right)&{\text{otherwise.}}\end{cases}}}

The Frank t-norm T p F {\displaystyle T_{p}^{\mathrm {F} }} is strict if p < +∞. The family is strictly decreasing and continuous with respect to p. An additive generator for T p F {\displaystyle T_{p}^{\mathrm {F} }} is

f p F ( x ) = { log x if  p = 1 1 x if  p = + log p 1 p x 1 otherwise. {\displaystyle f_{p}^{\mathrm {F} }(x)={\begin{cases}-\log x&{\text{if }}p=1\\1-x&{\text{if }}p=+\infty \\\log {\frac {p-1}{p^{x}-1}}&{\text{otherwise.}}\end{cases}}}

Yager t-norms

Graph of the Yager t-norm with p = 2

The family of Yager t-norms, introduced in the early 1980s by Ronald R. Yager, is given for 0 ≤ p ≤ +∞ by

T p Y ( x , y ) = { T D ( x , y ) if  p = 0 max ( 0 , 1 ( ( 1 x ) p + ( 1 y ) p ) 1 / p ) if  0 < p < + T m i n ( x , y ) if  p = + {\displaystyle T_{p}^{\mathrm {Y} }(x,y)={\begin{cases}T_{\mathrm {D} }(x,y)&{\text{if }}p=0\\\max \left(0,1-((1-x)^{p}+(1-y)^{p})^{1/p}\right)&{\text{if }}0<p<+\infty \\T_{\mathrm {min} }(x,y)&{\text{if }}p=+\infty \end{cases}}}

The Yager t-norm T p Y {\displaystyle T_{p}^{\mathrm {Y} }} 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 p Y {\displaystyle T_{p}^{\mathrm {Y} }} for 0 < p < +∞ arises from the Łukasiewicz t-norm by raising its additive generator to the power of p. An additive generator of T p Y {\displaystyle T_{p}^{\mathrm {Y} }} for 0 < p < +∞ is

f p Y ( x ) = ( 1 x ) p . {\displaystyle f_{p}^{\mathrm {Y} }(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 p A A ( x , y ) = { T D ( x , y ) if  p = 0 e ( | log x | p + | log y | p ) 1 / p if  0 < p < + T m i n ( x , y ) if  p = + {\displaystyle T_{p}^{\mathrm {AA} }(x,y)={\begin{cases}T_{\mathrm {D} }(x,y)&{\text{if }}p=0\\e^{-\left(|-\log x|^{p}+|-\log y|^{p}\right)^{1/p}}&{\text{if }}0<p<+\infty \\T_{\mathrm {min} }(x,y)&{\text{if }}p=+\infty \end{cases}}}

The Aczél–Alsina t-norm T p A A {\displaystyle T_{p}^{\mathrm {AA} }} 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 p A A {\displaystyle T_{p}^{\mathrm {AA} }} for 0 < p < +∞ arises from the product t-norm by raising its additive generator to the power of p. An additive generator of T p A A {\displaystyle T_{p}^{\mathrm {AA} }} for 0 < p < +∞ is

f p A A ( x ) = ( log x ) p . {\displaystyle f_{p}^{\mathrm {AA} }(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 p D ( x , y ) = { 0 if  x = 0  or  y = 0 T D ( x , y ) if  p = 0 T m i n ( x , y ) if  p = + 1 1 + ( ( 1 x x ) p + ( 1 y y ) p ) 1 / p otherwise. {\displaystyle T_{p}^{\mathrm {D} }(x,y)={\begin{cases}0&{\text{if }}x=0{\text{ or }}y=0\\T_{\mathrm {D} }(x,y)&{\text{if }}p=0\\T_{\mathrm {min} }(x,y)&{\text{if }}p=+\infty \\{\frac {1}{1+\left(\left({\frac {1-x}{x}}\right)^{p}+\left({\frac {1-y}{y}}\right)^{p}\right)^{1/p}}}&{\text{otherwise.}}\\\end{cases}}}

The Dombi t-norm T p D {\displaystyle T_{p}^{\mathrm {D} }} 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 p D {\displaystyle T_{p}^{\mathrm {D} }} 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 p D {\displaystyle T_{p}^{\mathrm {D} }} for 0 < p < +∞ is

f p D ( x ) = ( 1 x x ) p . {\displaystyle f_{p}^{\mathrm {D} }(x)=\left({\frac {1-x}{x}}\right)^{p}.}

Sugeno–Weber t-norms

The family of Sugeno–Weber t-norms was introduced in the early 1980s by Siegfried Weber; the dual t-conorms were defined already in the early 1970s by Michio Sugeno. It is given for −1 ≤ p ≤ +∞ by

T p S W ( x , y ) = { T D ( x , y ) if  p = 1 max ( 0 , x + y 1 + p x y 1 + p ) if  1 < p < + T p r o d ( x , y ) if  p = + {\displaystyle T_{p}^{\mathrm {SW} }(x,y)={\begin{cases}T_{\mathrm {D} }(x,y)&{\text{if }}p=-1\\\max \left(0,{\frac {x+y-1+pxy}{1+p}}\right)&{\text{if }}-1<p<+\infty \\T_{\mathrm {prod} }(x,y)&{\text{if }}p=+\infty \end{cases}}}

The Sugeno–Weber t-norm T p S W {\displaystyle T_{p}^{\mathrm {SW} }} 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 p S W {\displaystyle T_{p}^{\mathrm {SW} }} for 0 < p < +∞ is

f p S W ( x ) = { 1 x if  p = 0 1 log 1 + p ( 1 + p x ) otherwise. {\displaystyle f_{p}^{\mathrm {SW} }(x)={\begin{cases}1-x&{\text{if }}p=0\\1-\log _{1+p}(1+px)&{\text{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 and completing the t-norm by using the minimum on the rest of the unit square. It is based on the following theorem:

Let Ti for i in an index set I be a family of t-norms and (aibi) a family of pairwise disjoint (non-empty) open subintervals of . Then the function T: → defined as
T ( x , y ) = { a i + ( b i a i ) T i ( x a i b i a i , y a i b i a i ) if  x , y [ a i , b i ] 2 min ( x , y ) otherwise {\displaystyle T(x,y)={\begin{cases}a_{i}+(b_{i}-a_{i})\cdot T_{i}\left({\frac {x-a_{i}}{b_{i}-a_{i}}},{\frac {y-a_{i}}{b_{i}-a_{i}}}\right)&{\text{if }}x,y\in ^{2}\\\min(x,y)&{\text{otherwise}}\end{cases}}}
is a t-norm.
Ordinal sum of the Łukasiewicz t-norm on the interval and the product t-norm on the interval

The resulting t-norm is called the ordinal sum of the summands (Ti, ai, bi) for i in I, denoted by

T = i I ( T i , a i , b i ) , {\displaystyle T=\bigoplus \nolimits _{i\in I}(T_{i},a_{i},b_{i}),}

or ( T 1 , a 1 , b 1 ) ( T n , a n , b n ) {\displaystyle (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:

  • Each t-norm is a trivial ordinal sum of itself on the whole interval .
  • The empty ordinal sum (for the empty index set) yields the minimum t-norm Tmin. Summands with the minimum t-norm can arbitrarily be added or omitted without changing the resulting t-norm.
  • It can be assumed without loss of generality that the index set is countable, since the real line can only contain at most countably many disjoint subintervals.
  • An ordinal sum of t-norm is continuous if and only if each summand is a continuous t-norm. (Analogously for left-continuity.)
  • An ordinal sum is Archimedean if and only if it is a trivial sum of one Archimedean t-norm on the whole unit interval.
  • An ordinal sum has zero divisors if and only if for some index i, ai = 0 and Ti has zero divisors. (Analogously for nilpotent elements.)

If T = i I ( T i , a i , b i ) {\displaystyle T=\bigoplus \nolimits _{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 ) = { 1 if  x y a i + ( b i a i ) R i ( x a i b i a i , y a i b i a i ) if  a i < y < x b i y otherwise. {\displaystyle R(x,y)={\begin{cases}1&{\text{if }}x\leq y\\a_{i}+(b_{i}-a_{i})\cdot R_{i}\left({\frac {x-a_{i}}{b_{i}-a_{i}}},{\frac {y-a_{i}}{b_{i}-a_{i}}}\right)&{\text{if }}a_{i}<y<x\leq b_{i}\\y&{\text{otherwise.}}\end{cases}}}

where Ri is the residuum of Ti, 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:

  • Dubois–Prade t-norms, introduced by Didier Dubois and Henri Prade in the early 1980s, are the ordinal sums of the product t-norm on for a parameter p in and the (default) minimum t-norm on the rest of the unit interval. The family of Dubois–Prade t-norms is decreasing and continuous with respect to p..
  • Mayor–Torrens t-norms, introduced by Gaspar Mayor and Joan Torrens in the early 1990s, are the ordinal sums of the Łukasiewicz t-norm on for a parameter p in and the (default) minimum t-norm on the rest of the unit interval. The family of Mayor–Torrens t-norms is decreasing and continuous with respect to p..

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 divisors, N: → the function that assigns 1 − x to x and t = 0.5. Let T1 be the linear transformation of T into and R T 1 ( x , y ) = sup { z T 1 ( z , x ) y } . {\displaystyle R_{T_{1}}(x,y)=\sup\{z\mid T_{1}(z,x)\leq y\}.} Then the function
T r o t = { T 1 ( x , y ) if  x , y ( t , 1 ] N ( R T 1 ( x , N ( y ) ) ) if  x ( t , 1 ]  and  y [ 0 , t ] N ( R T 1 ( y , N ( x ) ) ) if  x [ 0 , t ]  and  y ( t , 1 ] 0 if  x , y [ 0 , t ] {\displaystyle T_{\mathrm {rot} }={\begin{cases}T_{1}(x,y)&{\text{if }}x,y\in (t,1]\\N(R_{T_{1}}(x,N(y)))&{\text{if }}x\in (t,1]{\text{ and }}y\in \\N(R_{T_{1}}(y,N(x)))&{\text{if }}x\in {\text{ and }}y\in (t,1]\\0&{\text{if }}x,y\in \end{cases}}}
is a left-continuous t-norm, called the rotation of the t-norm T.
The nilpotent minimum as a rotation of the minimum t-norm

Geometrically, the construction can be described as first shrinking the t-norm T to the interval 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).

Rotations of the Łukasiewicz, product, nilpotent minimum, and drastic t-norm

The theorem can be generalized by taking for N any strong negation, that is, an involutive strictly decreasing continuous function on , 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(x, y) ≤ z if and only if T(y, N(z)) ≤ N(x) for all x, y, z in .

The negation induced by Trot is the function N, that is, N(x) = Rrot(x, 0) for all x, where Rrot is the residuum of Trot.

See also

References

Category: