Fuzzy Inference Engines

Composition and Individual-Rule Based

Composition, Non-Linear Mappings
Olaf Wolkenhauer
Control Systems Centre
UMIST
o.wolkenhauer@umist.ac.uk
www.csc.umist.ac.uk/people/wolkenhauer.htm
2
Contents
1 Approximate Reasoning 4
1.1 Modus Ponens . . . . . . . . . . . . . . . . . . . . . . 6
1.2 Compositional Rule of Inference . . . . . . . . . . . . . 7
1.3 Fuzzy Implication Operators . . . . . . . . . . . . . . 9
2 Composition-Based Inference 11
2.1 The Algorithm . . . . . . . . . . . . . . . . . . . . . . 12
3 Individual-Rule Based Inference 13
3.1 The Algorithm . . . . . . . . . . . . . . . . . . . . . . 14
3.2 Example: Individual-Rule Based Inference . . . . . . . 16
3.3 Minimum Inference Engine . . . . . . . . . . . . . . . 17
3.4 Product Inference Engine . . . . . . . . . . . . . . . . 18
3.5 Singleton Inputs . . . . . . . . . . . . . . . . . . . . . 19
3.6 Dienes-Rescher Inference Engine . . . . . . . . . . . . 21
3.7 Zadeh Inference Engine . . . . . . . . . . . . . . . . . 22
Back View
3
3.8 Lukasiewicz Inference Engine . . . . . . . . . . . . . . 23
3.9 Singleton Input . . . . . . . . . . . . . . . . . . . . . . 24
4 Fuzzy Systems as Nonlinear Mappings 25
4.1 Defuzzication . . . . . . . . . . . . . . . . . . . . . . 26
4.2 Product Inference Engine with Singleton Input Data . 28
5 Comparison of Inference Engines 31
Back View
Section 1: Approximate Reasoning 4
1. Approximate Reasoning
Let proposition take the form
x is A
with fuzzy variable x taking values in X and A modelled by a fuzzy
set dened on the universe of discourse X by membership function
: X [0, 1].
A compound statement,
x is A AND y is B
is a fuzzy set A B in X Y with

AB
(x, y) = T
_

A
(x),
B
(y)
_
Back View
Section 1: Approximate Reasoning 5
For the sake of simplicity we consider a single rule of type
IF x is A, THEN y is B
which can be regarded as a fuzzy relation
R : X Y [0, 1]
(x, y) R(x, y)
where R(x, y) is interpreted as the strength of relation between x and
y. Viewed as a fuzzy set, with

R
(x, y)
.
= R(x, y)
denoting the degree of membership in the (fuzzy) subset R,
R
(x, y)
is computed by means of a fuzzy implication.
Back View
Section 1: Approximate Reasoning 6
1.1. Modus Ponens
The (generalised) modus ponens provides a mechanism for inference :
Implication: IF x is A, THEN y is B.
Premise: x is A

.
Conclusion: y is B

.
In terms of fuzzy relations the output fuzzy set B

is obtained as the
relational sup-t composition, B

= A

R.
The computation of the conclusion
B
(y) is realised on the basis
of what is called the compositional rule of inference.
Back View
Section 1: Approximate Reasoning 7
1.2. Compositional Rule of Inference
Given
A
(x), and
R
(x, y),
B
(y) is found by generalising the crisp
rule (from functions to relations..)
IF x = a AND y = f(x), THEN y = f(a)
The inference can be described in three steps :
1. Extension of A

to X Y , i.e
A

ext
(x, y) =
A
(x).
2. Intersection of A

ext
with R, i.e

ext
R
(x, y) = T
_

ext
(x, y),
R
(x, y)
_
(x, y)
3. Projection of A

ext
R on Y , i.e

B
(y) = sup
xX

ext
R
(x, y)
= sup
xX
T
_

ext
(x, y),
R
(x, y)
_
(1)
Back View
Section 1: Approximate Reasoning 8
0
1
Back View
Section 1: Approximate Reasoning 9
1.3. Fuzzy Implication Operators
Dienes-Rescher implication:

R
(x, y) = max
_
1
A
(x),
B
(y)
_
. (2)
Zadeh implication:

R
(x, y) = max
_
min
_

A
(x),
B
(y)
_
, 1
A
(x)
_
. (3)
Lukasiewicz implication:

R
(x, y) = min
_
1, 1
A
(x) +
B
(y)
_
(4)
G odel implication:

R
(x, y) =
_
1 if
A
(x)
B
(y),

B
(y) otherwise.
(5)
Back View
Section 1: Approximate Reasoning 10
Minimum implication:

R
(x, y) = min
_

A
(x),
B
(y)
_
(6)
Product implication:

R
(x, y) =
A
(x)
B
(y) (7)
Back View
Section 2: Composition-Based Inference 11
2. Composition-Based Inference
The way rules are combined, depends on the interpretation for what
a set of rules should mean. If rules are viewed as independent con-
ditional statements, then a reasonable mechanism for aggregating n
R
individual rules R
i
(fuzzy relations) is the union :
R
.
=
n
R
_
i=1
R
i
= S
_

R
1(x, y), . . . ,
R
n
R
(x, y)
_
. (8)
On the other hand, if rules are seen as strongly coupled conditional
statements, their combination should employ an intersection opera-
tor :
R
.
=
n
R

i=1
R
i
= T
_

R
1(x, y), . . . ,
R
n
R
(x, y)
_
. (9)
Back View
Section 2: Composition-Based Inference 12
2.1. The Algorithm
For the n
R
fuzzy if-then rules of the conjunctive linguistic model
R
i
: IF x
1
is A
i1
AND x
2
is A
i2
. . . AND x
r
is A
ir
, THEN y is B
i
Step 1: Determine the fuzzy set membership functions

A
i1
A
ir
(x
1
, . . . , x
r
)
.
= T
_

A
i1
(x
1
), . . . ,
A
ir
(x
r
)
_
.
(10)
Step 2:
R
i
(x, y), i = 1, . . . , n
R
, is calculated according to any fuzzy
implication (2)-(7).
Step 3:
R
(x, y) is determined according to (8) or (9).
Step 4: Finally, for an input A

, the output B

is

B
(y) = sup
xX
T
_

A
(x),
R
(x, y)
_
. (11)
Back View
Section 3: Individual-Rule Based Inference 13
3. Individual-Rule Based Inference
Given input fuzzy set A

in X, the fuzzy set B

i
in Y is given by the
generalised modus ponens (1), i.e

i
(y) = sup
xX
T
_

A
(x),
R
i
(x, y)
_
i = 1, . . . , n
R
(12)
The output of the fuzzy inference engine from the union

B
(y) = S
_

1
(y), . . . ,
B

r
(y)
_
(13)
or intersection

B
(y) = T
_

1
(y), . . . ,
B

r
(y)
_
(14)
of the individual output fuzzy sets B

1
, . . . , B

r
.
Back View
Section 3: Individual-Rule Based Inference 14
3.1. The Algorithm
Step 1: Determine the fuzzy set membership functions

A
i1
A
ir
(x
1
, . . . , x
r
)
.
= T
_

A
i1
(x
1
), . . . ,
A
ir
(x
r
)
_
.
(10)
Step 2: Equation (10) is viewed as the fuzzy set
A
in the fuzzy im-
plications (2)-(7) and
R
i
(x, y), i = 1, . . . , n
R
, is calculated
according to any of the implications.
Step 3: For a given input fuzzy set A

in X, determine the output

fuzzy set B

i
in Y for each rule R
i
according to the generalised
modus ponens (1), i.e

i
(y) = sup
xX
T
_

A
(x),
R
i
(x, y)
_
(12)
for i = 1, . . . , n
R
.
Back View
Section 3: Individual-Rule Based Inference 15
Step 4: The output of the fuzzy inference engine is obtained from
either the union

B
(y) = S
_

1
(y), . . . ,
B

r
(y)
_
(13)
or intersection

B
(y) = T
_

1
(y), . . . ,
B

r
(y)
_
(14)
of the individual output fuzzy sets B

1
, . . . , B

r
.
Back View
Section 3: Individual-Rule Based Inference 16
3.2. Example: Individual-Rule Based Inference
Minimum inference.
Singleton input.
Union intersection.
R
i
: IF x
1
is
Z
1 0 +1
AND x
2
is
P
1 0 +1
x

1
x

2
min
T()
w
(6)
w
(6)
THEN
Y
B
6
y
(6)
0
for all R
i
,...
Y
B
6
y

Back View
Section 3: Individual-Rule Based Inference 17
3.3. Minimum Inference Engine
Individual-rule based inference.
Union combination (13).
Fuzzy implication (6).
Max. for all the t-conorm operators.
Using (6) and the min for for all t-norm operators.
We obtain from (12) and (13) :

B
(y) = max
i=1,... ,n
R
_
sup
xX
min
_

A
(x),
A
i1
(x
1
), . . . ,
A
ir
(x
r
),
B
i
(y)
_
_
(15)
Back View
Section 3: Individual-Rule Based Inference 18
3.4. Product Inference Engine
Individual-rule based inference.
Union combination (13).
Fuzzy implication (7).
Max. for all the t-conorm operators.
Using (7) and the algebraic product for all t-norm operators
We obtain from (12) and (13) :

B
(y) = max
i=1,... ,n
R
_
sup
xX
_

A
(x)
r

k=1

A
ik
(x
k
)
B
i
(y)
__
(16)
Back View
Section 3: Individual-Rule Based Inference 19
3.5. Singleton Inputs
Let the fuzzy set A

is a singleton, that is, if we consider crisp input

data,

A
(x) =
_
1 if x = x

0 otherwise,
(17)
where x

is some point in X. Substituting (17) in

(15) (Minimum Inference Engine) and
(16) (Product Inference Engines),
we nd that the maximum
sup
xX
is achieved at
x = x

.
Back View
Section 3: Individual-Rule Based Inference 20
Hence, the Minimum Inference Engine (15) reduces to,

B
(y) = max
i=1,... ,n
R
_
min
_

A
i1
(x

1
), . . . ,
A
ir
(x

r
),
B
i
(y)
__
(18)
and the Product Inference Engine (16) reduces to

B
(y) = max
i=1,... ,n
R
_
r

k=1

A
ik
(x

k
)
B
i
(y)
_
(19)
A disadvantage of the minimum and product inference engines
is that
for some x X,
A
i
k
(x
k
) is very small,
then
B
(y) obtained from (15) and (16) will be very small.
Back View
Section 3: Individual-Rule Based Inference 21
3.6. Dienes-Rescher Inference Engine
Using individual-rule based inference.
Intersection combination (14).
Implication (2).
Using the min t-norm in (14) and (10).
We obtain from (12) :

B
(y) = min
i=1,... ,n
R
_
sup
xX
min
_

A
(x),
max
_
1 min
k=1,... ,r
_

A
ik
(x
k
)
_
,
B
i
(y)
_
_ (20)
Back View
Section 3: Individual-Rule Based Inference 22
3.7. Zadeh Inference Engine
Using individual-rule based inference.
Intersection combination (14).
Implication (3).
Using t-norm min in (14) and (10).
We obtain from (12) :

B
(y) = min
i=1,... ,n
R
_
sup
xX
min
_

A
(x), max
_
min
_

A
i1
(x
1
), . . . ,
A
ir
(x
r
),
B
i
(y)

,
1 min
k=1,... ,r
_

A
ik
(x
k
)
__
_
(21)
Back View
Section 3: Individual-Rule Based Inference 23
3.8. Lukasiewicz Inference Engine
Using individual-rule based inference.
Intersection combination (14).
Implication (4).
Using the min t-norm in (14) and (10).
We obtain from (12) :

B
(y) = min
i=1,... ,n
R
_
sup
xX
min
_

A
(x),
min
_
1, 1 min
k=1,... ,r
_

A
ik
(x
k
)
_
+
B
i
(y)
_
_
= min
i=1,... ,n
R
_
sup
xX
min
_

A
(x),
1 min
k=1,... ,r
_

A
ik
(x
k
)
_
+
B
i
(y)

_
(22)
Back View
Section 3: Individual-Rule Based Inference 24
3.9. Singleton Input
If the fuzzy set A

is a singleton, substituting (17) into the equations

of the inference engines (20)-(22), the sup
xX
is obtained at x = x

,
leading to the following singleton input inference engines :
From the Dienes-Rescher Inference Engine (20) :

B
(y) = min
i=1,... ,n
R
_
max
_
1 min
k=1,... ,r
_

A
ik
(x

k
)
_
,
B
i
(y)

_
From the Zadeh Inference Engine (21) :

B
(y) = min
i=1,... ,n
R
_
max
_
min
_

A
i1
(x

1
), . . . ,

A
ir
(x

r
),
B
i
(y)
_
, 1 min
k=1,... ,r
_

A
ik
(x

i
)
_
_
From the Lukasiewicz Inference Engine (22) :

B
(y) = min
i=1,... ,n
R
_
1, 1 min
k=1,... ,r
_

A
ik
(x

i
)
_
+
B
i
(y)
_
Back View
Section 4: Fuzzy Systems as Nonlinear Mappings 25
4. Fuzzy Systems as Nonlinear Mappings
Linguistic model:
R
i
: IF x
1
is A
i1
AND x
2
is A
i2
. . . AND x
r
is A
ir
, THEN y is B
i
Let the input data be crisp, i.e substituting (17) into the product
inference engine (16), we have

B
(y) = max
i=1,...,n
R
_
r

k=1

A
ik
(x

k
)
B
i
(y)
_
. (23)
Back View
Section 4: Fuzzy Systems as Nonlinear Mappings 26
4.1. Defuzzication
A defuzzier is a mapping from the fuzzy set B

in Y to a point
y

in Y .
To obtain a single-valued numerical output from the inference
engines, one has to somehow capture the information given in

B
(y) by a single number.
The centre of gravity defuzzier determines y

as the centre of
the area under the membership function
B
(y) :
y

.
=
_
Y

B
(y) y dy
_
Y

B
(y) dy
(24)
The main problem with this defuzzier is the calculation of the
integral for irregular shapes of
B
(y).
Back View
Section 4: Fuzzy Systems as Nonlinear Mappings 27
Since the fuzzy set B

is the union or intersection of n

R
fuzzy
sets, the weighted average of the centres of the n
R
fuzzy sets
provides a reasonable approximation of (24).
Let y
(i)
0
be the centre of the i
th
fuzzy set and w
(i)
be its height,
the center average defuzzier calculates y

as
y

.
=
n
R

i=1
y
(i)
0
w
(i)
n
R

i=1
w
(i)
. (25)
Back View
Section 4: Fuzzy Systems as Nonlinear Mappings 28
4.2. Product Inference Engine with Singleton Input Data
Use the centre average defuzzier (25).
The centre of the fuzzy set
A
ik
(x

k
)
B
i
(y) determines the
centre of B
i
, denoted y
(i)
0
in (25).
The height of the i
th
fuzzy set in (23) is
r

k=1

A
ik
(x

k
)
B
i
(y
(i)
0
) =
r

k=1

A
ik
(x

k
)
and equals w
(i)
in (25).
This reduces the fuzzy system to
y

=
n
R

i=1
y
(i)
0

r

k=1

A
ik
(x

k
)
n
R

i=1
r

k=1

A
ik
(x

k
)
Back View
Section 4: Fuzzy Systems as Nonlinear Mappings 29
... or in general, we nd that the fuzzy system is a nonlinear
mapping
f : X Y
x f(x)
where x X R
r
maps to f(x) Y R, a weighted average of the
consequent fuzzy sets :
f(x) =
n
R

i=1
y
(i)
0

r

k=1

A
ik
(x
k
)
n
R

i=1
r

k=1

A
ik
(x
k
)
. (26)
Back View
Section 4: Fuzzy Systems as Nonlinear Mappings 30
Similar to (26), we obtain for a fuzzy system, with
minimum inference engine (15),
singleton input (17) and
centre average defuzzier (25),
f(x) =
n
R

i=1
y
(i)
0

r
min
k=1

A
ik
(x
k
)
n
R

i=1
r
min
k=1

A
ik
(x
k
)
. (27)
Back View
Section 5: Comparison of Inference Engines 31
5. Comparison of Inference Engines
N Z P
N
Z
P
x
1
x
2
X
2
X
1
B
i
R
i
: IF x
1
is A
i1
AND x
2
is A
i2
, THEN y is B
i
Back View
Section 5: Comparison of Inference Engines 32
1 0.8 0.6 0.4 0.2 0 0.2 0.4 0.6 0.8 1
0
0.2
0.4
0.6
0.8
1

1 0.8 0.6 0.4 0.2 0 0.2 0.4 0.6 0.8 1

0
0.2
0.4
0.6
0.8
1

Figure 1: Gaussian and trapecoidal input fuzzy sets.

Back View
Section 5: Comparison of Inference Engines 33
1 0.8 0.6 0.4 0.2 0 0.2 0.4 0.6 0.8 1
0
0.2
0.4
0.6
0.8
1

1 0.8 0.6 0.4 0.2 0 0.2 0.4 0.6 0.8 1

0
0.2
0.4
0.6
0.8
1

Figure 2: Gaussian and trapecoidal outputs sets B

i
.
Back View
Section 5: Comparison of Inference Engines 34
1
0.5
0
0.5
1
1
0.5
0
0.5
1
1
0.5
0
0.5
1
x
1
x
2
Y
1
0.5
0
0.5
1
1
0.5
0
0.5
1
1
0.5
0
0.5
1
x
1
x
2
Y
Figure 3: Product inference with Gaussian and trapecoidal sets.
Back View
Section 5: Comparison of Inference Engines 35
1
0.5
0
0.5
1
1
0.5
0
0.5
1
1
0.5
0
0.5
1
x
1
x
2
Y
1
0.5
0
0.5
1
1
0.5
0
0.5
1
1
0.5
0
0.5
1
x
1
x
2
Y
Figure 4: Minimimum inference with Gaussian and trapecoidal sets.
Back View
Section 5: Comparison of Inference Engines 36
1 0.5 0 0.5 1
1
0.5
0
0.5
1
x
1
x
2
1 0.5 0 0.5 1
1
0.5
0
0.5
1
x
1
x
2
Figure 5: Contourplots for minimum inference (left) vs product inference
(right).
Back View
Section 5: Comparison of Inference Engines 37
1 0.5 0 0.5 1
1
0.5
0
0.5
1
x
1
x
2
1
0.5
0
0.5
1
1
0.5
0
0.5
1
1
0.5
0
0.5
1
x
1
x
2
Y
Figure 6: Minimum inference with input fuzzy partition that does not have
fully overlapping fuzzy sets.
Back View
Section 5: Comparison of Inference Engines 38
1 0.5 0 0.5 1
1
0.5
0
0.5
1
x
1
x
2
1
0.5
0
0.5
1
1
0.5
0
0.5
1
1
0.5
0
0.5
1
x
1
x
2
Y
Figure 7: Product inference with non-overlapping input fuzzy partition.
Back View
Section 5: Comparison of Inference Engines 39
References
[1] Kruse, R., Gebhardt, J. and Klawonn, F. : Foundations of Fuzzy
Systems. Wiley, 1994.
[2] Wang, L.-X. : A Course in Fuzzy Systems and Control.
Prentice Hall, 1997.
Back View