![]() |
![]() |
![]() ![]() ![]() |
We present an efficient algorithm [4]
to compute the membership function
. Practically the generalized modus ponens is computed for each element
u of the universe U and for each element v of the
universe V that needs much computation time and memory space. In
effect, it needs a discretisation of fuzzy sets on the universe U
and V and computation of a Cartesian product and a projection.
So, this algorithm uses properties based on cores and supports of fuzzy sets involved in the generalized modus ponens to provide the final fuzzy set with a parametric computation that needs a couple of simple operations (figure 5). It uses only the five parameters of the representation of fuzzy sets (figure 3.1).
Assume the membership functions of the fuzzy sets A,
, B and
defined by:
![]() |
This algorithm is based on the following general properties of the implication of Brouwer-Gödel:
Assume
and
, two real numbers in the interval [0,1] characterizing the previous properties
defined with the 2 fuzzy sets A and
by:
![]() |
and
are computed with intersections of segments of
the lines of cores and supports based on the five parameters of fuzzy sets
A and
. For example, in the figure 5,
and
are evaluated by:
![]() |
The fast algorithm called GMP is
defined by
and this body is:
Begin ¯
If ¯ Else if
Else if
Else if
Else
End |
The computation of
and
can be integrated in the previous fast algorithm then denoted
Figure 5: Parametric computation.