Professional Documents
Culture Documents
1
16
y
B1
/
(y) y
B16
/
(y)
...
y
B
/
(y)
Fig. 3.2: The logic architecture of the fuzzy inference engine.
MIN MIN
MAX MAX
MIN MIN
16-input OR function
Computational Intelligence. Principles, Techniques and Applications
________________________________________________________________
89
OR OR OR OR OR OR OR
OR OR OR OR
OR OR
OR
Fig. 3.3: The OR-tree realizing the 16-input OR function in the logic architecture of
Fig. 3.2. Fourteen (instead of sixteen) inputs are shown in the input layer for lack of
space.
3.12 Approximate Reasoning with Multiple Rules
Each with Multiple Antecedent Clauses
To start with let us consider n rules each with 2 antecedent clauses only as
presented below:
PR1. IF x is A1 and y is B1 THEN z is C1.
PR2. IF x is A2 and y is B2 THEN z is C2.
PR3. IF x is A3 and y is B3 THEN z is C3.
... ... ... .... ... ...
... ... ... .... ... ..
PRn. IF x is An and y is Bn THEN z is Cn.
Now, for the i-th rule membership distribution of the fuzzy implication relation
is given by
y
Ri
(x, y; z) = f
i
(t(y
Ai
, y
Bi
), y
Ci
) (3.30)
where f
i
is a implication function. If the t-norm, for example, is interpreted as
the min operator, and the f
i
as the Mamdani type min operator, then y
Ri
=
min(min(y
Ai
, y
Bi
), y
Ci
).
Fuzzy Logic and Approximate Reasoning
________________________________________________________________
90
Given an observed distribution of x is A
/
and y is B
/
, we can easily evaluate
the membership distribution of z is C
i
/
by the i-th rule as follows:
y
Ci
/
= t(y
A
/
, y
B
/
) o y
Ri
(x, y; z) (3.31)
Consequently, taking the contribution of all n rules together, we can determine
the membership distribution of z is C
/
by taking the max of y
Ci
/
for i=1 to n.
Symbolically,
n
y
C
/
= max [y
Ci
/
]
i=1
n
= max [t(y
A
/
, y
B
/
) o y
Ri
(x, y; z)] [by (3.31)]
i=1
n
= max[t(y
A
/
, y
B
/
) o f
i
(t(y
Ai
, y
Bi
), y
Ci
)] [by (3.30)] (3.32)
i=1
3.13 Fuzzy Abductive Reasoning
The reasoning methodology introduced in the last three sections was based on
GMP. There are, however, situations when we need to determine the
membership distribution of the antecedent clause of a rule for an observed
distribution of its consequence. This is called GMT or abductive reasoning [8].
The adverb fuzzy has been included in the heading to distinguish it from the
crisp abduction. The most important application of abductive reasoning is in
diagnostic problems. In diagnostic applications, the defective item in a system
needs to be identified from the measurement data. Since abnormality in
measurements is mainly caused by the abnormal behavior of the defective
components, determination of the defective item is feasible by reasoning with
GMT.
In this section we discuss the principle of abductive reasoning by 2 chain rules
listed below:
PR1. IF x is A THEN y is B.
PR2. IF y is B THEN z is C.
Computational Intelligence. Principles, Techniques and Applications
________________________________________________________________
91
Suppose, the observed membership distribution of z is C
/
is available, and we
want to determine the membership distribution of x is A
/
. To do so, we have to
apply GMT twice, once to determine the membership of y is B
/
and next to
determine the membership of x is A
/
. The whole scheme is stepwise outlined
below:
1. Determine the membership distribution y
R1
(x, y) and y
R2
(y, z) by the
following formula:
y
R1
(x, y)= f(y
A
(x)
,
y
B
(y)) (3.32)
y
R2
(y, z)= f(y
B
(y)
,
y
C
(z)) (3.33)
where f is any typical implication function.
2. Compute y
B
/
first and then y
A
/
by executing the following two steps in
order:
y
B
/
(y) =y
c
/
(z) o [y
R2
(y, z)]
T
(3.34)
y
A
/
(x)= y
B
/
(y) o [y
R1
(x, y)]
T
(3.35)
where T denotes the transposition operation over the specified relations.
If number of chain rules increase we can easily evaluate the membership
distribution of the cause from the membership distribution of its direct or
chained effect by extending the above principle.
Example 3.8: Given below a fragment of the diagnostic knowledge base of an
audio player system:
PR1. IF transformer secondary output is CLOSE -TO 20 V
THEN rectifier output is CLOSE-TO 12 V.
PR2. IF the transformer primary input is CLOSE-TO 230 V
THEN transformer secondary output is CLOSE-TO 20 V.
and an observation that the rectifier output is CLOSE-TO 10 V. Also suppose
that the following membership distributions are available, we need to determine
the membership distribution of the transformer primary input to be CLOSE-TO
approximately 230V. Let the relational matrices for PR1 and PR2 be R1 and R2
respectively. Then suppose:
Fuzzy Logic and Approximate Reasoning
________________________________________________________________
92
and y
CLOSE-TO
(rectifier-output) = |0.9/10V, 0.6/12V, 0.2/14V.
It is to be noted that to represent that rectifier output is CLOSE-TO 10V, we
assigned a high membership value to 10V and relatively smaller membership
values to 12V and 14V.
Now, by step 2 of the abductive reasoning principle, we find
y
CLOSE-TO
(transformer-output)
= y
CLOSE-TO
(rectifier-output) o [y
R1
(trans.-output, recti.-output)]
T
= |0.9/ 18V, 0.6/20V, 0.7/22V.
and y
CLOSE-TO
(transformer-input)
y
R1
(trans.-output, recti.-output) =
y
R2
(trans.-input, trans.-output) =
0.9 0.7 0.8
0.6 1.0 0.9
0.7 0.8 1.0
10 12 14
18
20
22
Rectifier output.
T
r
a
n
s
f
o
r
m
e
r
o
u
t
p
u
t
.
0.8 0.7 0.8
0.6 1.0 0.9
0.7 0.9 1.0
18 20 22
210
230
250
Transformer output.
T
r
a
n
s
f
o
r
m
e
r
i
n
p
u
t
.
Computational Intelligence. Principles, Techniques and Applications
________________________________________________________________
93
=y
CLOSE-TO
(transformer-output) o [y
R2
(trans.-input, trans.-output)]
T
=|0.8/ 210V, 0.7/ 230V, 0.7/ 250V
3.14 Conclusions
Classical reasoning models, such as modus ponens, modus tollens and
syllogisms, have limited applications for their inability in rule firing with partial
matching of data clauses. The chapter extended the classical models using the
logic of fuzzy sets to reason with a knowledge base in presence of partially
instantiable data clauses.
Among the different fuzzy reasoning schemes introduced in this chapter,
multiple rules each with multiple antecedent clauses using Mamdani`s
implication relation is of special interest for its utility in many practical
problems. The Togai-Watanabe`s VLSI engine has also received much attention
in the fields of fuzzy control. There is a vast literature on fuzzy reasoning, some
of which employed structured models like fuzzy Petri nets [6]. Most of the
applications of fuzzy reasoning in control, communication, signal processing
and robotics until date employ the classical fuzzy models outlined in the chapter.
Exercise
1. Given the following rule:
IF resistance is EXCESSIVE
THEN current-flow is INSIGNIFICANT.
Also given the relational matrix
R(resistance, current) =
r
e
s
i
s
t
a
n
c
e
.
current.
150mA 50mA 10mA
10k
50k
100k
0.8 0.7 0.9
0.6 0.4 0.3
0.2 0.5 0.1
Fuzzy Logic and Approximate Reasoning
________________________________________________________________
94
Suppose the membership distribution of very excessive resistance is given
by
y
VERY-EXCESSIVE
(resistance) = | 0.7/ 10k, 0.8/ 50k, 0.9/ 100k.
Determine the membership distribution of very insignificant current flow
through the device under test.
[Answer: y
VERY-INSIGNIFICANT
(current) = |0.7/ 100mA, 0.7/ 50mA,
0.7/ 10mA.]
2. Suppose, the membership of 'current flow through a device is very
insignificant is given by
y
VERY-INSIGNIFICANT
(current) = |0.7/100mA, 0.7/50mA, 0.7/10mA.
Also given the rule and the relational matrix introduced in Exercise 1.
Determine by abductive reasoning the membership of 'resistance of the
device under test is very excessive.
[Answer: y
VERY-EXCESSIVE
(resistance) = |0.7/ 10k, 0.6/50k, 0.5/100k.]
3. Verify the results obtained for Exercises 1 and 2 by cylindrical extension,
intersection and projection operations.
4. Construct following Togai and Watanabe a parallel logic engine for fuzzy
modus tollens.
n
[Hints: y
Ai
/
(x) = max [ max | min (y
Bi
/
(y), min (y
Ai
(x), y
Bi
(y))]
i=1 yVY
n
=max [max|min(
i
, y
Ai
(x))]
i=1
where
i
= min (y
Bi
/
(y), y
Bi
(y)).
yVY
The rest is obvious.]
Computational Intelligence. Principles, Techniques and Applications
________________________________________________________________
95
References
[1] Dubois, D. and Prade, H., Fuzzy Sets and Systems. Theory and
Applications, Academic Press, NY, 1980.
[2] Jackson, P., Introduction to Expert Systems, Addison-Wesley, Reading,
MA, 1986.
[3] Jang, J.-S. R., Sun, C.-T., Mizutani, E., Neuro-Fuzzy and Soft Computing.
A Computational Approach to Learning and machine Intelligence,
Prentice-Hall, NJ, 1997.
[4] Klir, G. J. and Yuan, B., Fuzzy Sets and Fuzzy Logic. Theory and
Applications, Prentice-Hall, NJ, 1995.
[5] Konar, A. and Jain, L. C., 'An introduction to computational intelligence
paradigms, In Practical Applications of Computational Intelligence
Techniques, Jain, L. and Widle, P. D. (Eds.), Kluwer Academic Press,
Dordrecht, pp. 1-9, 2001.
[6] Konar, A. and Mandal, A. K., 'Uncertainty management in expert
systems using fuzzy Petri nets, IEEE Trans. on Knowledge and Data
Engineering, vol. 8, no. 1, pp. 96-105, 1996.
[7] Ross, T. J., Fuzzy Logic with Engineering Applications, McGraw-Hill,
NY, 1991.
[8] Saha, P. and Konar, A., 'A heuristic algorithm for computing the max-
min inverse fuzzy relation, Int. J. of Approximate Reasoning, Elsevier,
North Holland, vol. 30, pp. 131-147, 2002.
[9] Togai, M. and Watanabe, H., 'Expert system on a chip: An engine for
real time approximate reasoning, IEEE Expert, pp. 55-62, Fall 1986.
[10] Wang, L.-X., A Course in Fuzzy Systems and Control, Prentice-Hall, NJ,
1997.
[11] Zadeh, L. A., 'The role of fuzzy logic in the management of uncertainty
in expert systems, Fuzzy Sets and Systems, Elsevier, North Holland, vol.
11, pp. 199-227, 1983.
[12] Zimmerman, H. J., Fuzzy Set Theory and its Applications, Kluwer
Academic Publishers, Dordrecht, The Netherlands, 1991.