CS621: Introduction to Artificial

Intelligence

Pushpak Bhattacharyya
CSE Dept.,
IIT Bombay
Lecture–3: Some proofs in Fuzzy Sets and
Fuzzy Logic
27th July 2010
Theory of Fuzzy Sets

 Given any set ‘S’ and an element ‘e’, there is a very

natural predicate, μs(e) called as the belongingness
predicate.
 The predicate is such that,
μs(e) = 1, iff e ∈ S
= 0, otherwise
 For example, S = {1, 2, 3, 4}, μs(1) = 1 and μs(5) =
0
 A predicate P(x) also defines a set naturally.
S = {x | P(x) is true}
For example, even(x) defines S = {x | x is even}
Fuzzy Set Theory (contd.)

 In Fuzzy theory
μs(e) = [0, 1]
 Fuzzy set theory is a generalization of classical set
theory aka called Crisp Set Theory.
 In real life, belongingness is a fuzzy concept.
Example: Let, T = “tallness”
μT (height=6.0ft ) = 1.0
μT (height=3.5ft) = 0.2
An individual with height 3.5ft is “tall” with a
degree 0.2
Representation of Fuzzy sets
Let U = {x1,x2,…..,xn}
|U| = n
The various sets composed of elements from U are presented
as points on and inside the n-dimensional hypercube. The crisp
sets are the corners of the hypercube. μA(x1)=0.3
μA(x2)=0.4
(0,1) (1,1)
x2 (x1,x2)
U={x1,x2}
x2 A(0.3,0.4)

(0,0) (1,0)

Φ x1 x1

A fuzzy set A is represented by a point in the n-dimensional

space as the point {μA(x1), μA(x2),……μA(xn)}
 Degree of fuzziness
The centre of the hypercube is the most fuzzy
set. Fuzziness decreases as one nears the
corners
Measure of fuzziness
Called the entropy of a fuzzy set
Fuzzy set Farthest corner

E ( S )  d ( S , nearest ) / d ( S , farthest)

Entropy Nearest corner

 (0,1) (1,1)

x2

A (0.5,0.5)

d(A, nearest)

(0,0) (1,0)
x1

d(A, farthest)
Definition
Distance between two fuzzy sets
n
d ( S1 , S 2 )   |  s1 ( xi )  s2 ( xi ) |
i 1

L1 - norm

Let C = fuzzy set represented by the centre point

d(c,nearest) = |0.5-1.0| + |0.5 – 0.0|
=1
= d(C,farthest)
=> E(C) = 1
Definition
Cardinality of a fuzzy set
n
m( s )   s ( xi ) (generalization of cardinality of
i 1 classical sets)

Union, Intersection, complementation, subset hood

 s s ( x)  max(  s ( x),  s ( x)), x U
1 2 1 2

 s s ( x)  min(  s ( x),  s ( x)), x U

1 2 1 2

 s ( x)  1   s ( x)
c
Example of Operations on
Fuzzy Set
 Let us define the following:
 Universe U={X1 ,X2 ,X3}
 Fuzzy sets
 A={0.2/X1 , 0.7/X2 , 0.6/X3} and
 B={0.7/X1 ,0.3/X2 ,0.5/X3}
Then Cardinality of A and B are computed as follows:
Cardinality of A=|A|=0.2+0.7+0.6=1.5
Cardinality of B=|B|=0.7+0.3+0.5=1.5

While distance between A and B

d(A,B)=|0.2-0.7)+|0.7-0.3|+|0.6-0.5|=1.0
What does the cardinality of a fuzzy set mean? In crisp sets it
means the number of elements in the set.
Example of Operations on Fuzzy Set
(cntd.)
Universe U={X1 ,X2 ,X3}
Fuzzy sets A={0.2/X1 ,0.7/X2 ,0.6/X3} and B={0.7/X1 ,0.3/X2
,0.5/X3}

A U B= {0.7/X1, 0.7/X2, 0.6/X3}

A ∩ B= {0.2/X1, 0.3/X2, 0.5/X3}

Ac = {0.8/X1, 0.3/X2, 0.4/X3}

Laws of Set Theory
• The laws of Crisp set theory also holds for fuzzy set
theory (verify them)
• These laws are listed below:
– Commutativity: AUB=BUA
– Associativity: A U ( B U C )=( A U B ) U C
– Distributivity: A U ( B ∩ C )=( A ∩ C ) U ( B ∩ C)
A ∩ ( B U C)=( A U C) ∩( B U C)
– De Morgan’s Law: (A U B) C= AC ∩ BC
(A ∩ B) C= AC U BC
Distributivity Property Proof
 Let Universe U={x1,x2,…xn}
pi =µAU(B∩C)(xi)
=max[µA(xi), µ(B∩C)(xi)]
= max[µA(xi), min(µB(xi),µC(xi))]
qi =µ(AUB) ∩(AUC)(xi)
=min[max(µA(xi), µB(xi)), max(µA(xi), µC(xi))]
Distributivity Property Proof
 Case I: 0<µC<µB<µA<1
pi = max[µA(xi), min(µB(xi),µC(xi))]
= max[µA(xi), µC(xi)]=µA(xi)
qi =min[max(µA(xi), µB(xi)), max(µA(xi), µC(xi))]
= min[µA(xi), µA(xi)]=µA(xi)
 Case II: 0<µC<µA<µB<1
pi = max[µA(xi), min(µB(xi),µC(xi))]
= max[µA(xi), µC(xi)]=µA(xi)
qi =min[max(µA(xi), µB(xi)), max(µA(xi), µC(xi))]
= min[µB(xi), µA(xi)]=µA(xi)
Prove it for rest of the 4 cases.
Note on definition by extension and intension
S1 = {xi|xi mod 2 = 0 } – Intension
S2 = {0,2,4,6,8,10,………..} – extension
How to define subset hood?
Meaning of fuzzy subset
Suppose, following classical set theory we say
B A
if
B ( x)   A ( x)x

Consider the n-hyperspace representation of A and B

(0,1) (1,1)

A
x2 . B1 Region where B ( x)   A ( x)
.B2
.B3
(0,0) (1,0)
x1
This effectively means
B  P ( A) CRISPLY
P(A) = Power set of A
Eg: Suppose
A = {0,1,0,1,0,1,…………….,0,1} – 104 elements
B = {0,0,0,1,0,1,……………….,0,1} – 104 elements
Isn’t B  A with a degree? (only differs in the 2nd element)
Subset operator is the “odd
man” out
 AUB, A∩B, Ac are all “Set Constructors” while
A  B is a Boolean Expression or predicate.
 According to classical logic
 In Crisp Set theory A  B is defined as
x xA  xB
 So, in fuzzy set theory A  B can be defined as
x µA(x)  µB(x)
Zadeh’s definition of subsethood goes
against the grain of fuzziness theory
 Another way of defining A  B is as follows:

x µA(x)  µB(x)

But, these two definitions imply that µP(B)(A)=1

where P(B) is the power set of B

Thus, these two definitions violate the fuzzy principle that every
belongingness except Universe is fuzzy
 Fuzzy definition of subset
Measured in terms of “fit violation”, i.e. violating the
condition B ( x)   A ( x)
Degree of subset hood S(A,B)= 1- degree of superset

 max( 0,  B ( x)   A ( x))
= 1
x
m( B )

m(B) = cardinality of B
= 
x
 B ( x)
We can show that E ( A)  S ( A  Ac , A  Ac )
Exercise 1:
Show the relationship between entropy and subset hood
Exercise 2:
Prove that
S ( B, A)  m( A  B) / m( B)

Subset hood of B in A
 Fuzzy sets to fuzzy logic
Forms the foundation of fuzzy rule based system or fuzzy expert system
Expert System
Rules are of the form
If
C1  C2  ...........Cn
then
Ai
Where Cis are conditions
Eg: C1=Colour of the eye yellow
C2= has fever
C3=high bilurubin
A = hepatitis
In fuzzy logic we have fuzzy predicates
Classical logic
P(x1,x2,x3…..xn) = 0/1
Fuzzy Logic
P(x1,x2,x3…..xn) = [0,1]
Fuzzy OR
P( x)  Q( y )  max( P( x), Q( y ))
Fuzzy AND
P( x)  Q( y )  min( P( x), Q( y ))

Fuzzy NOT
~ P( x)  1  P ( x)
 Fuzzy Implication
 Many theories have been advanced and many
expressions exist
 The most used is Lukasiewitz formula
 t(P) = truth value of a proposition/predicate. In
fuzzy logic t(P) = [0,1]
 t(P  Q ) = min[1,1 -t(P)+t(Q)]

Lukasiewitz definition of implication