Fuzzy Relations, Rules and Inferences

Soft Computing 1 / 65
Concept of fuzzy system

Fuzzy
element(s)

Fuzzy set(s)
I

N Fuzzy rule(s)

P
Fuzzy
implication(s)
U (Inferences) O

T U
Fuzzy system
T

Soft Computing T 2 / 65
Fuzzy Relations

Soft Computing 3 / 65
Crisp relations

To understand the fuzzy relations, it is better to discuss

first crisp relation.
Suppose, A and B are two (crisp) sets. Then Cartesian
product denoted as A × B is a collection of order pairs,
such that
A × B = { (a, b)|a ∈ A and b ∈ B}

Note :
(1) A × B ≠ B × A
(2) |A × B| = |A| × |B|
(3)A × B provides a mapping from a ∈ A to b ∈ B.

The mapping so mentioned is called a relation.

Soft Computing 4 / 65
Crisp relations
Example 1:
Consider the two crisp sets A and B as given below. A ={ 1,
2, 3, 4}
B = {3, 5, 7 }.
Then, A × B = {(1, 3), (1, 5), (1, 7), (2, 3), (2, 5), (2, 7),
(3, 3),
7), (3,
(4, 5),
3), (4, 5), (4, 7)}
Let us define a relation R as R = {(a, b)|b = a + 1, (a, b) ∈
A × B}
Then, R = { (2, 3), (4, 5)} in this case.
We can represent the relation R in a matrix form as
3 5
follows.
 7 
1 0 0 0
R
2
 1 0 
0 0
3 0 
=
0
4 0 1
0
Soft Computing 5 / 65
Operations on crisp relations

Suppose, R(x, y ) and S(x, y ) are the two relations define

over two crisp sets x ∈ A and y ∈ B
Union:

R(x, y ) ∪ S(x, y ) = max (R(x, y ), S(x, y ));

Intersection:

R(x, y ) ∩ S(x, y ) = min(R(x, y ), S(x, y ));

Complement:

R(x, y ) = 1 − R(x, y )

Soft Computing 6 / 65
Example: Operations on crisp relations

Example:
Suppose, R(x, y ) and S(x, y ) are the two relations define
over two crisp sets x ∈ A and y ∈ B

0 1   0 0 
0 1 0
0 0 1 0
R =   and S  0 1 0  ;
0 0 0  0 1 
=
1
0 0 0 0 0 0
0 0 1
Find the
following:
1 R ∪

2 S
R∩
3 S
R

Soft Computing 7 / 65
Composition of two crisp relations

Given R is a relation on X ,Y and S is another relation on

Y ,Z . Then R ◦ S is called a composition of relation on X
and Z which is defined as follows.

R ◦ S = { (x, z)|(x, y ) ∈ R and (y, z) ∈ S and ∀ y ∈ Y }

Max-Min Composition
Given the two relation matrices R and S, the max-min
composition is defined as T = R ◦ S ;

T (x, z) = max {min{R(x, y ), S(y, z) and ∀y ∈ Y } }

Soft Computing 8 / 65
Composition: Composition
Example:
Given
X = {1, 3, 5}; Y = {1, 3, 5}; R = {(x, y )|y = x + 2}; S =
{(x, y R
Here, )|xand
< yS}is on X ×
Y . Thus, we have
R = { (1, 3), (3,
5)}
S = { (1, 3), (1, 5),
(3, 5)}
1
 1 3 5  
1 0 1 0 3 1
R= 3 0 0  and  
1 5 0 0 S= 5

0 
1 0 1
3 0 10 
Using max-min composition R 1 
◦ S= 5 0 0
Soft Computing
0 9 / 65
Fuzzy relations
Fuzzy relation is a fuzzy set defined on the Cartesian
product of crisp set X1, X2, ..., Xn
Here, n-tuples (x1, x2, ..., xn) may have varying
degree of memberships within the relationship.
The membership values indicate the strength of the
relation between the tuples.
Example:
X = { typhoid, viral, cold } and Y = { running nose,
high temp,
shivering }
The fuzzy relation R is
defined as
runningnose hightemperature shivering
 
typhoid 0. 0. 0.8
viral  1 9 0.7 
cold 0. 0. 0.6
2 9
Soft Computing 10 /
Fuzzy Cartesian product

Suppose
A is a fuzzy set on the universe of discourse X with
µA(x )|x ∈ X
B is a Rfuzzy
Then =A× setB on
⊂X the
× universe
Y ; whereofRdiscourse Y with µB
has its membership
(y )|y
function∈ Y
by µR (x, given
y ) = µA×B (x, y ) = min{ µA (x ), µB (y )}
Example :
A = {(a 1 , 0.2), (a2, 0.7), (a3, 0.4)}and B = {(b 1 , 0.5),
(b2, 0.6)}
 
a1 0.2
b1 0.2
b2
R=A×B= a2  0.5 
0.6 a3 0.4
0.4

Soft Computing 11 /
Operations on Fuzzy relations
Let R and S be two fuzzy relations on A × B.
Union:

µR∪S (a, b) = max { µR (a, b), µS (a, b)}

Intersection:

µR∩S (a, b) = min{ µR (a, b), µS (a, b)}

Complement:

µR (a, b) = 1 − µR (a, b)

Composition

T =R◦S
µR◦S = maxy ∈Y { min(µR (x, y ), µS (y,
z))}
Soft Computing 12 /
Operations on Fuzzy relations: Examples
Example:
X = (x1, x2, x3); Y = (y1, y2); Z = (z1,
z2, z3);
y1 y2
R= x2  .2 
 
0 x
x1 3
0.5
0.8 0.1
0.9 0.6
z1
1 .
S y2 z26
= 0.5 z1 z2 z3
z3 
 0.4 0.5
y 0x1 0.40.5 0.7
R◦S= 
x2.5 0.8 0.9 
0.8 0.9
0 x3 0.6 0.6 0.7
µR◦S (x1 , y1 ) = max { min(x1 , y1 ), min(y1 , z1 ), min(x1 , y2 ), min(y2 ,
z1 )}
= max {min(0.5, 0.6), min(0.1, 0.5)} = max {0.5, 0.1} = 0.5 13 /
Soft Computing
Fuzzy relation : An example

Consider the following two sets P and D, which represent

a set of paddy plants and a set of plant diseases. More
precisely
P = {P1 , P2, P3, P 4 } a set of four varieties of paddy
plants
D = {D1 , D2, D3, D 4 } of the four various diseases
affecting the plants
In addition to these, also consider another set S = {S1 , S2,
S3, S 4 } be the common
D D
symptoms
D D
of the diseases.
1 2 3 4


Let, R be a relation
P1 0.6 on0.6
P × 0.9
D, representing
0.8 which plant is
susceptible Pto

0.1
2 which 0.2 0.9
diseases, then
 R can be stated as
R P  
0.8
3 .9 0.3 0.4
= 04
P 0.8 0.8 0.4
0.9
0.2
Soft Computing 14 /
Fuzzy relation : An example

Also, consider T be the another relation on D × S, which is

given by S1 S2 S3 S4

D1 0.1 0.2 0.7 0.9
D2
 
1.0 1.0 0.4 
S D  
0.6
3 .0 0.0 0.5
= 04
D 0.9 0.9 1.0 0.8 0.2
Obtain the association of plants with the different
symptoms of the disease using max-min composition.
Hint: Find R ◦ T , and verify
that S1 S2 S3 S4

P1 0.8 0.8 0.8 0.9
P2
 
0.8 0.8 
R◦S P 
0.8
3 0.9 0.8 
.8 0.8
= 0
P4 0.8 0.9
0.8 0.7 0.9
Soft Computing 15 /
Fuzzy relation : Another example
Let, R = x is relevant to y
and S = y is relevant to z
be two fuzzy relations defined on X × Y and Y × Z ,
respectively, where X = {1, 2, 3} ,Y = {α, β, γ, δ} and
Z = {a, b}.
Assume that R and S can be expressed with the following
relation matricesα: β γ δ
 
1 0.1 0.3 0.5 0.7
R  
2 0.4 0.2 0.8 0.9
=
and
a
3 0.6 0.8 0.3 0.2
b
S
β
 0.2 
γ  0.9
0.3
α 0.5 0.1 
=
0.6
δ 0.7
0.2 Soft Computing 16 /
Fuzzy relation : Another example
Now, we want to find R ◦ S, which can be interpreted as
a derived
fuzzy relation x is relevant to z.
Suppose, we are only interested in the degree of relevance
between 2 ∈ X and a ∈ Z . Then, using max-min
composition,
µR◦S (2, a) = max {(0.4 ∧ 0.9), (0.2 ∧ 0.2), (0.8 ∧ 0.5),
(0.9 ∧=0.7)}
max { 0.4, 0.2, 0.5,
0.7} = 0.7 s

Soft Computing 17 /
2D Membership functions : Binary fuzzy relations

(Binary) fuzzy relations are fuzzy sets A × B which map each

element in A × B to a membership grade between 0 and 1
(both inclusive).
Note that a membership function of a binary fuzzy
relation can be depicted with a 3D plot.

 (x, y)

Important: Binary fuzzy relations are fuzzy sets with two

dimensional MFs and so on.

Soft Computing 18 /
2D membership function : An example

Let, X = R+ = y (the positive real line)

and R = X × Y = ”y is much greater than x”
The membership function of µR (x, y ) is
defined as (y if y >
µR (x, y ) −x4)
0 xif y ≤
=
x
Suppose, X = {3, 4, 5} and Y = {3, 4, 5, 6,
7}, then
3 5 6

 4 7
3 0 0.5 0.75
R 4  0 
0.25 1.0
= 0 0
5
0 0.25 0.5
0.75
0 0.25
0.5
Soft Computing 19 /
Problems to ponder:

How you can derive the

following? If x is A or y is B
then z is C; Given that
1
R1 : If x is A then z is c [R1 ∈ A × C]
2
R2 : If y is B then z is C [R2 ∈ B × C]

Hint:
You have given two relations R1 and R2.
Then, the required can be derived using the union
operation of R1
and R2

Soft Computing 20 /
Fuzzy Propositions

Soft Computing 21 /
Two-valued logic vs. Multi-valued logic

The basic assumption upon which crisp logic is based -

that every proposition is either TRUE or FALSE.

The classical two-valued logic can be extended to

multi-valued logic.

As an example, three valued logic to denote true(1),

false(0) and 2
indeterminacy
( ).
1

Soft Computing 22 /
Two-valued logic vs. Multi-valued logic

Different operations with three-valued logic can be extended

as shown in the following truth table:

a b ∧ ∨ ¬a =⇒ =
0 0 0 0 1 1 1
1 1 1
0 2 0 2 1 1 2
0 1 0 1 1 1 0
1 1 1 1 1
2 0 0 2 2 2 2
1 1 1 1 1 1
2 2 2 2 2 2 1
1 1 1 1
2 1 2 1 2 1 2
1 0 0 1 1 0 0
1 1 1 1
1 2 2 1 1 2 2
1 1 1 1 1 1 1

Fuzzy connectives used in the above

table are:
AND (∧), OR (∨), NOT (¬), IMPLICATION (=⇒) and EQUAL (=).

Soft Computing 23 /
Three-valued logic

Fuzzy connectives defined for such a three-valued logic

better can be stated as follows:
Symbol Connective Usage Definition
¬ NOT ¬P 1 − T (P)
∨ OR P∨Q max{T(P), T(Q) }
∧ AND P∧Q min{ T(P),T(Q) }
=⇒ IMPLICATION (P =⇒ Q) or max{(1 -
(¬P ∨ Q) T(P)),
T(Q) }
= EQUALITY (P = Q) or 1 − |T (P) − T (Q)|
[(P =⇒ Q) ∧
(Q =⇒ P)]

Soft Computing 24 /
Fuzzy proposition

Example 1:
P : Ram is
honest
1 T(P) = : Absolutely false
0.0
2 : Partially false
T(P) =
3
0.2 : May be false or not
false
4
T(P) =
0.4 : May be true or not
5
true
6 T(P) =
0.6 : Partially true

T(P) = : Absolutely true.

0.8
Soft Computing 25 /
Example 2 :Fuzzy proposition

P : Mary is efficient ; T(P) =

0.8; Q : Ram is efficient ;
T(Q) = 0.6
1 Mary is not efficient.
T (¬P) = 1 − T (P) = 0.2
2 Mary is efficient and so is Ram.
T (P ∧ Q) = min{ T (P), T (Q)} = 0.6
3 Either Mary or Ram is efficient
T (P ∨ Q) = max T (P), T (Q) = 0.8
4 If Mary is efficient then so is Ram
T (P =⇒ Q) = max { 1 − T (P), T (Q)}
= 0.6

Soft Computing 26 /
Fuzzy proposition vs. Crisp proposition

The fundamental difference between crisp (classical)

proposition and fuzzy propositions is in the range of
their truth values.

While each classical proposition is required to be either

true or false, the truth or falsity of fuzzy proposition is a
matter of degree.

The degree of truth of each fuzzy proposition is

expressed by a value in the interval [0,1] both
inclusive.

Soft Computing 27 /
Canonical representation of Fuzzy proposition
Suppose, X is a universe of discourse of five
persons. Intelligent of x ∈ X is a fuzzy set as
defined below.

Intelligent: {(x 1 , 0.3), (x2, 0.4), (x3, 0.1), (x4,

0.6), (x5, 0.9)}
We define a fuzzy proposition as follows:

P : x is intelligent
The canonical form of fuzzy proposition of this
type, P is expressed by the sentence P : v is F .
Predicate in terms of fuzzy set.
P : v is F ; where v is an element that takes values v from
some universal set V and F is a fuzzy set on V that
represents a fuzzy predicate.
In other words, given, a particular element v , this
Soft Computing 28 /
Graphical interpretation of fuzzy proposition

F ( )v

P: v is F
T(P)
T(P) = µF(v) for a v ε V

v V

For a given value v of variable V in proposition P, T(P)

denotes the degree of truth of proposition P.

Soft Computing 29 /
Fuzzy Implications

Soft Computing 30 /
Fuzzy rule

A fuzzy implication (also known as fuzzy If-Then rule,

fuzzy rule, or fuzzy conditional statement) assumes the
form :

If x is A then y is B

where, A and B are two linguistic variables defined by

fuzzy sets A
and B on the universe of discourses X and Y ,
respectively.

Often, x is A is called the antecedent or premise, while

y is B is called the consequence or conclusion.

Soft Computing 31 /
Fuzzy implication : Example 1

If pressure is High then temperature is Low

If mango is Yellow then mango is Sweet else mango

is Sour If road is Good then driving is Smooth else

traffic is High

The fuzzy implication is denoted as R : A → B

In essence, it represents a binary fuzzy relation R

on the (Cartesian) product of A × B

Soft Computing 32 /
Fuzzy implication : Example 2

Suppose, P and T are two universes of discourses

representing pressure and temperature, respectively as
follows.

P = { 1,2,3,4} and T ={ 10, 15, 20, 25, 30, 35, 40,

45, 50 }

Let the linguistic variable High temperature and Low

pressure are given as

THIGH =
{(20, 0.2), (25, 0.4), (30, 0.6), (35, 0.6), (40, 0.7), (45,
0.8), (50, 0.8)}

PLOW = (1, 0.8), (2, 0.8), (3, 0.6), (4, 0.4)

Soft Computing 33 /
Fuzzy implications : Example 2

Then the fuzzy implication If temperature is High then

pressure is Low can be defined as

R : THIGH → PLOW
1 2
 
3

4

 
where, R 20 .0.2 0.2 0.2
= 0.2 6 
 
25  0.4 0.4 0.4 
0.4

30 0.6 0.6 0.6
Note : If temperature is 40 then what about low
0.4
pressure?
35 0 0.6 0.6
0.4
Soft Computing 34 /
Interpretation of fuzzy rules

In general, there are two ways to interpret the fuzzy rule

A → B as A coupled with B

A entails B

Soft Computing 35 /
Interpretation as A coupled with B
∫
R:A→ B=A×B X µA (x ) ∗ µB (y )|( x ,y ) ; where ∗ is
=
T-norm operator. ×Y called a

T-norm operator
The most frequently used T-norm
operators are: Minimum : Tmin (a, b) =
min(a, b) = a ∧ b Algebric product : Tap (a,
b) = ab

Bounded product : Tbp (a, ab)if= 0b∨=(a + b −
Drastic product : T = 1b if a=
1) dp

1 0 if a, b <
1
Here, a = µA(x ) and b = µB (y ). T∗ is called the function of T-norm
operator.
Soft Computing 36 /
Interpretation as A coupled with B

Based on the T-norm operator as defined above, we can

automatically define the fuzzy rule R : A → B as a fuzzy set
with two-dimentional MF:
µR (x, y ) = f (µA (x ), µB (y )) = f (a, b) with a=µA(x ) , b=µB
(y ), and f is the fuzzy implication function.

Soft Computing 37 /
Interpretation as A coupled with B

In the following, few implications of R :

A→ B

Min operator: ∫
Rm = A × B X µA(x ) ∧ µB (y (x,y
)| ) or min(a, b) = a ∧
= ×Y f [Mamdanib rule]

Algebric product operator

∫
Rap = A × B X µA (x ).µB or f (a, b) =
(x,y ) ap
= ×Y (y )| ab
[Larsen rule]

Soft Computing 38 /
Product Operators

Bounded product operator

∫
∫ bp = A × B X µA (x ) ⊙ B(y )|
R
=X ×Y 0 ∨ (µA (x )×Y+ µB(x,y =
(y )) − 1)|
or fbp) = 0 ∨ (a + b −
( x ,y

1)
Drastic product ∫ operator
Rdp = A × B X µA µB
=  ×Y (x )ˆ• (y )|
(x,y )
 a if b=
or fdp (a, b) = 1b if a=
1 0 if otherwise

Soft Computing 39 /
Interpretation of A entails B

There are three main ways to interpret such

implication:
Material implication :

R : A → B = A¯ ∪ B

Propositional calculus :

R : A → B = A¯ ∪ (A ∩ B)

Extended propositional calculus :

R : A → B = (A¯ ∩ B¯ ) ∪ B

Soft Computing 40 /
Interpretation of A entails B

With the above mentioned implications, there are a number

of fuzzy implication functions that are popularly followed in
fuzzy rule-based system.

Zadeh’s arithmetic rule :

∫
Rza = ¯A ∪ B X 1 ∧ (1 − µA (x ) + µB (x,y
=
or ×Y (y ))| )

fza (a, b) = 1 ∧ (1 − a +
b)

Zadeh’s ∫ :
Rmm =¯Amax-min rule
∪ (A ∩ B) X (1 − µA (x )) (µA (x ) ∧
B (y ))|
=
or ×Y ∨ µ
(x,y )
fmm (a, b) = (1 − a) ∨(a ∧
b)

Soft Computing 41 /
Interpretation of A entails B

Boolean fuzzy rule

∫
Rbf = ¯A ∪ B X (1 − µA (x )) ∨ µB (x,y
=
or ×Y (x )| )

fbf (a, b) = (1 − a) ∨
b;

Goguen’s fuzzy rule: 1 if a≤

∫
Rgf = X µA (x ) ∗B µ (y )| where a ∗ bba if a>
×Y (x,y )
b= b

Soft Computing 42 /
Example 3: Zadeh’s Max-Min rule

If x is A then y is B with the implication of Zadeh’s max-min

rule can be written equivalently as :

Rmm = (A × B) ∪ (A¯ × Y )

Here, Y is the universe of discourse with membership values

for all
y ∈ Y is 1, that is , µY (y ) = 1∀y ∈ Y .
Suppose X = {a, b, c, d } and Y = {1, 2, 3, 4}
and A = { (a, 0.0), (b, 0.8), (c, 0.6), (d, 1.0)}
B = {(1, 0.2), (2, 1.0), (3, 0.8), (4, 0.0)} are two fuzzy sets.

We are to determine Rmm = (A × B) ∪ (A¯ × Y )

Soft Computing 43 /
Example 3: Zadeh’s min-max rule:

The computation of Rmm = (A × B) ∪ (A¯ × Y ) is as

follows: 1 2
 3 
a
4 0
A×B  0 0  an
c  
= 0.2 0
d
d
b
0.2 0.2 0.8 0.8
0
1 0.6 0.62 03
 4 
a 1.0 0.8 0
1 1 1 1
 b 0.2 0.2 0.2 
A¯ × Y c  
= 0.4 0.2
0.4 0.4 0.4
d 0 0 0 0

Soft Computing 44 /
Example 3: Zadeh’s min-max rule:

Therefor
e, 1 2 3
 4 
a
1 1 1 1
 0.2 0.8 0.8 
Rmm = (A × B) ∪ (A¯ × Y c  b

)= 0.4
d 0.2
0.2 0.6 0.6 0.4
1.0 0.8 0

Soft Computing 45 /
Example 3 :

X = { a, b, c, d }
Y = { 1, 2, 3, 4}
Let, A = { (a, 0.0), (b, 0.8), (c, 0.6),
(d, 1.0)}
B = { (1, 0.2), (2, 1.0), (3, 0.8), (4,
0.0)}
Determine the implication relation :
1 2
If x is A then y is B  3 
a
4 0
Here, A × B  0 0 
c  
= 0.2 0
d
b
0.2 0.2 0.8 0.8
0
0.6 0.6 0
Soft Computing 46 /
Example 3 :

1 2 4
 3 
a 1
1 1 1 0.2
 
and A¯ × Y c  b 0.2 0.2 0.4 
= 0.4 0.2 0
0.4 0.4 1 2 3 4
d 0 0 0 
a 1 1 1 1
b
 0.2 0. 0.8 0.2 
Rmm = (A × B) ∪ (A¯ × Y c  8 
)= 0.4 0. 0.6 0.4
d 6
This R represents If x is A then y is 0.2 1. 0.8 0
B 0

Soft Computing 47 /
Example 3 :

IF x is A THEN y is B ELSE y is
C. The relation R is equivalent
to

R = (A ×
B) ∪ (A¯
× C)

The membership function of R

is given by
µR (x, y ) =max [min{µA (x ), µB
(y )}, min{µA¯ (x ), µC (y )]
Soft Computing 48 /
Example 4:

X = { a, b, c, d }
Y = { 1, 2, 3, 4}
A = { (a, 0.0), (b, 0.8), (c, 0.6),
(d, 1.0)}
B = { (1, 0.2), (2, 1.0), (3, 0.8),
(4, 0.0)}
C = { (1, 0), (2, 0.4), (3, 1.0), (4,
0.8)}
1 2
Determine the implication  3 
a
relation : 4 0
Here,
If × B y is B elsec y is 0C
A then
x is A
0 

= 0.2 0
d
0.2b 0.2 0.8 0.8
0
0.6 0.6 0
Soft Computing 49 /
Example 4:

 1 2 3 4

b 0 0.2 0.2 0.2
 
and A¯ × C c  0 0.4  0.4
= 0.4
d 0 0 0
 0
a

R  1 2 3
 4
c   
= 0.2
d
0 0.4 1.0 0.8
0.2b 0.2 0.8 0.8
0.2
0.6 0.6 0.4
1.0 0.8 0

Soft Computing 50 /
Interpretation of fuzzy implication
If x is A then y is B

{
If x is A then y is B else y
is C

{ {

Soft Computing 51 /
Fuzzy Inferences

Soft Computing 52 /
Fuzzy inferences

Let’s start with propositional logic. We know the

following in propositional logic.

1 Modus Ponens : P, P =⇒ ⇔Q
Q,
2 ⇔, ¬P
Modus Tollens : P =⇒ Q,
3
¬Q ⇔, P =⇒
R
Chain rule : P =⇒ Q, Q
=⇒ R

Soft Computing 53 /
An example from propositional logic

Give
n
1 C ∨ D

2 ∼ H =⇒ (A∧ ∼ B)

3 C ∨ D =⇒∼ H

4 (A∧ ∼ B) =⇒ (R ∨
S)
From the above can we infer R ∨ S?

Similar concept is also followed in fuzzy logic to infer a fuzzy

rule from a set of given fuzzy rules (also called fuzzy rule
base).

Soft Computing 54 /
Inferring procedures in Fuzzy logic
Two important inferring procedures are used in fuzzy
systems :

Generalized Modus Ponens (GMP)

If x is A Then y is
′
B x is A
— — — — — —
— — — — — —
′
y is B

Generalized Modus
Tollens (GMT)
If x is A Then y is
′
B y is B
— — — — — —
Soft Computing 55 /
Fuzzy inferring procedures

′ ′
Here, A, B, A and B are fuzzy sets.
′ ′
To compute the membership function A and B the
′
max-min composition of fuzzy sets B and A
′
,respectively with R(x, y ) (which is the known
implication relation) is to be used.

Thus,
′ ′
B = A ◦ R(x, µB (y ) = max [min(µA′ (x ), µR (x,
y) y ))]
′ ′
A = B ◦ R(x, y µA (x ) = max [min(µB ′ (y ), µR (x,
)
y ))]

Soft Computing 56 /
Generalized Modus Ponens
Generalized Modus Ponens (GMP)

P : If x is A then y is B

Let us consider two sets of variables x and y be

X = {x 1 , x2, x 3 } and Y = {y 1 , y 2 }, respectively.

Also, let us consider the following.

A = { (x1 , 0.5), (x2 , 1), (x3 , 0.6)}
B = { (y1 , 1), (y2 , 0.4)}

Then, given a fact expressed by the proposition

′ ′
x is A , where A = { (x1 , 0.6), (x2 , 0.9), (x3 ,
0.7)}
′
derive a conclusion in the form y is B (using generalized
modus ponens (GMP)). Soft Computing 57 /
Example: Generalized Modus Ponens

If x is A Then y is
′
B x is A
——————
——————
–
′
y is B

We are to
x
 y1B ′ y2
find  y1 y2

′ 1  1
= A ◦ R(x, y ) .5 0.4 0.5
A × B = 02  1 0.4  and A × Y = 2  0
x 
where
x
R(x, y ) =
0.5
x 0.6 0.4
x x3
max {A ×3 B, A × 0
Y} 0.4
Note: For A × B, µA×B (x, y ) = min(µA x, µB 0.4
(y ))

Soft Computing 58 /
Example: Generalized Modus Ponens

y1 y2

x 
1
.5 0.5
R(x, y ) = (A × B) ∪ (A × y )02  1 
= x x3 0.4 0.4
0.6

′
Now, A = { (x1 , 0.6), (x2 , 0.9), (x3 ,
0.7)} ′ ′
Therefore, B = A ◦ R(x, 
y) = 0.5

0.6 0.9 0.7 ◦0.5 1 0.4 = 0.9
0.5 0.6 0.4

′ ′
Thus we derive that y is B where B = {(y 1 , 0.9), (y2,
0.5)}

Soft Computing 59 /
Example: Generalized Modus Tollens

Generalized Modus Tollens (GMT)

P: If x is A Then y is B
′
Q: y is B
— — — — — — — — — — —
— — —
′
x is A

Soft Computing 60 /
Example: Generalized Modus Tollens

Let sets of variables x and y be X = { x1 , x2 , x3 } and y =

{ y1 , y2 } , respectively.

Assume that a proposition If x is A Then y is B given

where
A = {(x 1 , 0.5), (x2, 1.0), (x3, 0.6)} and B = {(y 1 , 0.6), (y2,
0.4)}

Assume now that a fact expressed by a proposition y is B

′
is given where B = { (y1 , 0.9), (y2 , 0.7)} .

′
From the above, we are to conclude that x is A . That is,
′
we are to determine A

Soft Computing 61 /
Example: Generalized Modus Tollens

We first calculate R(x, y ) = (A × B) ∪

(A × y )
 y1 y2
x 
0
1
.5 0.5
R(x, y ) = 2  1 
x x3 0.4 0.4
0.6
′ ′
Next, we calculate A = B ◦ R(x,
y)
x
 y1 y2

1 .5
0.7 ◦ 02  10.5 0.4  = 0.5 0.9
′
A =
0.9 x x3 0.6

0.6 0.4
′
Hence, we calculate that x is A
where
′
A = [(x1 , 0.5), (x2 , 0.9), (x3 , 0.6)]
Soft Computing 62 /
Practice

Apply the fuzzy GMP rule to deduce Rotation is quite

slow

Given that :

If temperature is High then rotation is

Slow. temperature is Very High

Let,

X = {30, 40, 50, 60, 70, 80, 90, 100} be

the set of temperatures.

Y = {10, 20, 30, 40, 50, 60} be the set

of rotations per minute.
Soft Computing 63 /
Practice
The fuzzy set High(H), Very High (VH), Slow(S) and Quite
Slow (QS) are given below.

H = { (70, 1), (80, 1), (90, 0.3)}

VH = { (90, 0.9), (100, 1)}

S = { (30, 0.8), (40, 1.0), (50, 0.6)}

QS = { (10, 1), (20, 0.8)}

1 If temperature is High then the rotation

is Slow.

R = (H × S) ∪ (H ×
2
Y)

Thus, to deduce ”rotation

temperature is Quite Slow”, we make use the
is Very High
composition rule QS = VH ◦ R(x, y )
Soft Computing 64 /
Any questions??

Soft Computing 65 /