Fuzzy Logic : Introduction

1 / 69
What is Fuzzy logic?

Fuzzy logic is a mathematical language to express

something.
This means it has grammar, syntax, semantic like a
language for communication.

There are some other mathematical languages also

known
• Relational algebra (operations on sets)
• Boolean algebra (operations on Boolean variables)
• Predicate logic (operations on well formed formulae
(wff), also called predicate propositions)

Fuzzy logic deals with Fuzzy set.

2 / 69
A brief history of Fuzzy Logic

First time introduced by Lotfi Abdelli Zadeh (1965),

University of California, Berkley, USA (1965).

He is fondly nick-named as
LAZ
Soft Computing 3 / 69
A brief history of Fuzzy logic

1 Dictionary meaning of fuzzy is not clear,

noisy etc. Example: Is the picture on this
2 slide is fuzzy?

Antonym of fuzzy is crisp

Example: Are the chips crisp?

Soft Computing 4 / 69
Example : Fuzzy logic vs. Crisp logic

Yes or
Crisp answer No
True or
False

Milk Yes

Wate
A
Crisp
liquid
r
No
Coca

Is the
Spite liquid
colorless
?
Soft Computing 5 / 69
Example : Fuzzy logic vs. Crisp logic

May be

May not be

Fuzzy answer Absolutely

Partially

etc

Soft Computing 6 / 69
Example : Fuzzy logic vs. Crisp logic

Score

99
Extremely
 Ankit honest

 Rajesh
Very 75
 Santosh honest
Fuzzy
 Kabita 55
Honest at
times
 Salmon

Extremely 35
Is the person dishonest
honest?

Soft Computing 7 / 69
World is fuzzy!

Our world is better

described with
fuzzily!

Soft Computing 8 / 69
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 9 / 69
Concept of fuzzy set
To understand the concept of fuzzy set it is better, if we first
clear our idea of crisp set.
X = The entire population of India.
H = All Hindu population = { h1, h2, h3, ... , hL }
M = All Muslim population = { m1, m2, m3, ... , mN }

Universe of X
discourse

H
M

Here, All are the sets of finite numbers of

individuals. Such a set is called crisp set.

Soft Computing 10 /
Example of fuzzy set

Let us discuss about fuzzy

set. X = All students in
IT60108.
S = All
{ (s, g) | students.
Good s ∈ X } and g(s) is a measurement of
goodness
student s. of the
Example:
S = { (Rajat, 0.8), (Kabita, 0.7), (Salman, 0.1), (Ankit,
0.9) } etc.

Soft Computing 11 /
Fuzzy set vs. Crisp set

Crisp Set Fuzzy Set

1. S = { s | s ∈ X } 1. F = (s, µ) | s ∈ X
and
µ(s) is the degree of
s.
2. It is a collection of 2. It is collection of
el- or-
ements. dered pairs.
3. Inclusion of an 3. Inclusion of an
el- el-
ement s ∈ X into S ement s ∈ X into F
is crisp, that is, has is fuzzy, that is, if
strict boundary yes present, then with a
or no. degree of
membership.
Soft Computing 12 /
Fuzzy set vs. Crisp set

Note: A crisp set is a fuzzy set, but, a fuzzy set is not

necessarily a crisp set.

Example:
H = { (h1, 1), (h2, 1), ... , (hL, 1) }
Person = { (p1 , 1), (p2 , 0), ... , (pN , 1) }
In case of a crisp set, the elements are with extreme values
of degree of membership namely either 1 or 0.

How to decide the degree of memberships of elements in a

fuzzy set?
City Bangalor Bomba Hyderaba Kharagp Madras Delhi
e y d ur
DoM 0.95 0.90 0.80 0.01 0.65 0.75
How the cities of comfort can be
judged?
Soft Computing 13 /
Example: Course evaluation in a crisp way

1 EX = Marks ≥ 90
2 A = 80 ≤ Marks <
3 90 B = 70 ≤
4 Marks < 80 C =
5 60 ≤ Marks < 70
6 D = 50 ≤ Marks <
7 60 P = 35 ≤
Marks < 50 F =
Marks < 35

Soft Computing 14 /
Example: Course evaluation in a crisp way

F P D C B A EX
1

0
3 5 6 7 80 90
5 0 0 0 100

Soft Computing 15 /
Example: Course evaluation in a fuzzy way

F P D C B A EX
1

0
3 5 6 7 80 90
5 0 0 0 100

Soft Computing 16 /
Few examples of fuzzy set

High Temperature

Low Pressure

Color of Apple

Sweetness of

Orange Weight of

Mango

Note: Degree of
membership
values lie in the
range [0...1].
Soft Computing 17 /
Some basic terminologies and notations

Definition 1: Membership function (and Fuzzy set)

If X is a universe of discourse and x ∈ X, then a fuzzy set

A in X is defined as a set of ordered pairs, that is
A = {(x, µA(x ))|x ∈ X } where µA(x) is called the
membership function for the fuzzy set A.

Note:
µA(x) map each element of X onto a membership
grade (or membership value) between 0 and 1
(both inclusive).

Question:
How (and who) decides µA(x) for a Fuzzy set A in X ?

Soft Computing 18 /
Some basic terminologies and notations

Example:

X = All cities in

India A = City of

comfort

A={(New Delhi,
0.7), (Bangalore,
0.9), (Chennai,
0.8), (Hyderabad,
0.6), (Kolkata,
0.3), (Kharagpur,
0)} Soft Computing 19 /
Membership function with discrete membership
values

The membership values may be of discrete

values.
A

Soft Computing 20 /
Membership function with discrete membership
values

Either elements or their membership values (or both) also

may be of discrete values.

A ={(0,0.1),(1,0.30),(2,0.78)……(10,0.1)}

1.0
0.8
0.6 Note : X = discrete
µ

value
0.4

0.2
How you measure happiness ??
0 2 4 6 8 10

Number of children (X)

A = “Happy family”

Soft Computing 21 /
Membership function with continuous
membership values

1.0
0.8
 B (x) 1
4

0.6
  x  50 
1 
 10  

0.4

0.2

0 50 10
0 B

Age (X)
Note : x = real value
B = “Middle aged” = R+

Soft Computing 22 /
Fuzzy terminologies: Support

Support: The support of a fuzzy set A is the set of all

points x ∈ X
such that µA (x ) > 0

Soft Computing 23 /
Fuzzy terminologies: Core

Core: The core of a fuzzy set A is the set of all points x in X

such that
µA (x ) = 1

core (A) = {x | µA(x) = 1}

1.0
µ

0.5

Soft Computing 24 /
Fuzzy terminologies: Normality

Normality : A fuzzy set A is a normal if its core is non-empty.

In other words, we can always find a point x ∈ X such that
µA(x ) = 1.

1.0

Soft Computing 25 /
Fuzzy terminologies: Crossover points

Crossover point : A crossover point of a fuzzy set A is a point

x∈X
at which µA (x ) = 0.5. That is
Crossover (A) = {x |µA(x ) =
0.5}.

Soft Computing 26 /
Fuzzy terminologies: Fuzzy Singleton

Fuzzy Singleton : A fuzzy set whose support is a single point in

X
with µA(x ) = 1 is called a fuzzy singleton. That is
|A| = |{ x | µA(x ) = 1}| = 1. Following fuzzy set is not a fuzzy
singleton.

Soft Computing 27 /
Fuzzy terminologies: α-cut and strong α-cut

α-cut and strong α-cut :

The α-cut of a fuzzy set A is a crisp set

defined by

Aα = { x | µA (x) ≥ α }

Strong α-cut is defined similarly :

Aα ’ = { x | µA (x) > α }

Note : Support(A) = A0’ and Core(A) = A1.

Soft Computing 28 /
Fuzzy terminologies: Convexity
Convexity : A fuzzy set A is convex if and only if for any x1 and
x2 ∈ X
and any λ ∈ [0, 1]

µA (λx1 + (1 -λ)x2) ≥ min(µA(x1), µA(x2))

Note :
• A is convex if all its α- level sets are convex.
• Convexity (Aα ) =⇒ Aα is composedNon-convex
Membership
of a single line
segment only.
function is
convex
Membership
function

1. 1.
0 0

Soft Computing 29 /
Fuzzy terminologies: Bandwidth

Bandwidth :

For a normal and convex fuzzy set, the bandwidth (or width)
is defined as the distance the two unique crossover points:
Bandwidth(A) = | x1 - x2 |
where µA(x1) = µA(x2) = 0.5

Soft Computing 30 /
Fuzzy terminologies: Symmetry

Symmetry :

A fuzzy set A is symmetric if its membership function around

a certain point x = c, namely µA(x + c) = µA(x - c) for all x ∈
X.

Soft Computing 31 /
Fuzzy terminologies: Open and Closed
A fuzzy set A is
Open left
If limx →−∞ µA (x) = 1 and limx → +∞ µA (x)
=0
Open right:
If limx →−∞ µA (x) = 0 and limx → +∞ µA (x) =
1
Closed
If : limx →−∞ µAOpen
(x)left
= limx → +∞ µA (x) = 0 Open right
Closed

Soft Computing 32 /
Fuzzy vs. Probability

Fuzzy : When we say about certainty of a thing

Example: A patient come to the doctor and he has to

diagnose so that medicine can be prescribed.
Doctor prescribed a medicine with certainty 60% that the
patient is suffering from flue. So, the disease will be cured
with certainty of 60% and uncertainty 40%. Here, in stead
of flue, other diseases with some other certainties may be.

Probability: When we say about the chance of an event to

occur

Example: India will win the T20 tournament with a chance

60% means that out of 100 matches, India own 60 matches.

Soft Computing 33 /
Prediction vs. Forecasting

The Fuzzy vs. Probability is analogical to Prediction vs.

Forecasting

Prediction : When you start guessing about things.

Forecasting : When you take the information from the past

job and apply it to new job.

The main difference:

Prediction is based on the best guess from experiences.
Forecasting is based on data you have actually recorded and
packed from previous job.

Soft Computing 34 /
Fuzzy Membership
Functions

Soft Computing 35 /
Fuzzy membership functions
A fuzzy set is completely characterized by its membership
function (sometimes abbreviated as MF and denoted as µ
). So, it would be important to learn how a membership
function can be expressed (mathematically or otherwise).
Note: A membership function can be on
(a) a discrete universe of discourse and
(b)a continuous universe of discourse.
Example:

1.0 1.0
0.8 0.8
0.6 0.6
µA

µB
0.4 0.4

0.2 0.2

0 10 20 30 40 50
0 2 4 6 8 10
60

Number of children (X) Age (X)

A = Fuzzy set of “Happy family” B = “Young age”

Soft Computing 36 /
Fuzzy membership functions
So, membership function on a discrete universe of course
is trivial. However, a membership function on a
continuous universe of discourse needs a special
attention.
Following figures shows a typical examples of
membership functions.

µ
µ

x x x

< triangular > < trapezoidal > < curve >

µ

x x

< non-uniform > < non-uniform >

Soft Computing 37 /
Fuzzy MFs : Formulation and parameterization
In the following, we try to parameterize the different
MFs on a continuous universe of discourse.
Triangular MFs : A triangular MF is specified by three
parameters
{ a, b, c} and can be formulated  as follows.
0 if x ≤ a
 x −a
triangle (x ;a ,b ,c ) b−a if a ≤ x ≤ b (1
c−x
=  c−b if b ≤ x ≤ c )

0 if c ≤ x

1.0

a b c

Soft Computing 38 /
Fuzzy MFs: Trapezoidal
A trapezoidal MF is specified by four parameters {a, b, c,
d } and can be defined as follows:

1 if x ≤ a
 x −a if a ≤ x
≤b
 b−a
trapeziod (x ; a, b, c, (2
2d if b ≤ x ≤ c
d) = )
 d −c if c ≤ x ≤ d
 −x

0 if d ≤ x

1.0

a b c d

Soft Computing 39 /
Fuzzy MFs: Gaussian

A Gaussian MF is specified by two parameters {c, σ}

and can be defined as below:
1 x−c
gaussian(x;c,σ) — 2( ) .
σ
=e 2

c
0.
0.1 0.9
1 c c

Soft Computing 40 /
Fuzzy MFs: Generalized bell

It is also called Cauchy MF. A generalized bell MF is specified

by three parameters {a, b, c } and is defined as:

bell(x; a, b, c)= 1
1+| x −a c |
2b

b
Slope at x
= 2a
Slope at y =  b
x b y
2a

c- c c+
a a

Soft Computing 41 /
Example: Generalized bell MFs

1
Example: 1+ 2
;
µ(x)=
a = b = 1 and cx =
0;
1.0

-1 0 1

Soft Computing 42 /
Generalized bell MFs: Different shapes

Changing Changing
a b

Changing
a Changing a and
b

Soft Computing 43 /
Fuzzy MFs: Sigmoidal MFs

Parameters: {a, c } ; where c = crossover point and a =

slope at c; 1
Sigmoid(x;a,c a
− [ x− c ]
)= 1+e

1.
0

Slope =
0.
a 5

Soft Computing 44 /
Fuzzy MFs : Example

Example : Consider the following grading system for a

course.

Excellent = Marks ≤ 90
Very good = 75 ≤ Marks
≤ 90 Good = 60 ≤ Marks
≤ 75 Average = 50 ≤
Marks ≤ 60 Poor = 35 ≤
Marks ≤ 50 Bad= Marks
≤ 35

Soft Computing 45 /
Grading System

A fuzzy implementation will look like the

following.

Bad poo Averag Goo Very Excellen

r e d Good t

1
.8
.6
.4
.2
0
1 2 3 6
40 70 80 90
0 0 0 0
50
marks
You can decide a standard fuzzy MF for each of the fuzzy
garde.
Soft Computing 46 /
Operations on Fuzzy Sets

Soft Computing 47 /
Basic fuzzy set operations: Union

Union (A ∪ B):

µA∪B (x ) = max{ µA (x ), µB
(x )}

Example:
A = {(x 1 , 0.5), (x2, 0.1), (x3, 0.4)} and
B = {(x 1 , 0.2), (x2, 0.3), (x3, 0.5)};
C = A ∪ B = { (x1 , 0.5), (x2 , 0.3), (x3 , 0.5)}
µB µB
µ µA
µAUB
µA
x b q c x b q c
a p a p

Soft Computing 48 /
Basic fuzzy set operations: Intersection

Intersection (A ∩ B):

µA∩B (x ) = min{ µA (x ), µB
(x )}

Example:
A = {(x 1 , 0.5), (x2, 0.1), (x3, 0.4)} and
B = {(x 1 , 0.2), (x2, 0.3), (x3, 0.5)};
C = A ∩ B = { (x1 , 0.2), (x2 , 0.1), (x3 , 0.4)}
µA
µAᴖB
µB
µ
x b q c p b q c
a p a
x

Soft Computing 49 /
Basic fuzzy set operations: Complement

Complement (AC ):

µAAC (x ) = 1-µA (x
)

Example:
A = {(x 1 , 0.5), (x2, 0.1), (x3, 0.4)}
C = AC = {(x
µA 1 , 0.5), (x2, 0.9), (x3, 0.6)}
1.0
µA
µA’
µ

p x q p x q

Soft Computing 50 /
Basic fuzzy set operations: Products

Algebric product or Vector product (A•B):

µA•B (x ) = µA (x ) • µB
(x )

Scalar product (α × A):

µα A (x ) = α · µA (x )

Soft Computing 51 /
Basic fuzzy set operations: Sum and Difference

Sum (A + B):

µA+B (x ) = µA (x ) + µB (x ) − µA (x ) ·
µB (x )

Difference (A − B = A ∩ BC ):

µA−B (x ) = µA∩B C (x )

Disjunctive sum: A ⊕ B = (AC ∩ B) ∪ (A ∩ BC ))

Bounded Sum: | A(x) ⊕ B(x) |

µ|A( x ) ⊕B( x ) | = min{ 1, µA (x ) + µB

(x )}

Bounded Difference: | A(x) ⊖ B(x) |

µ = max{ 0, µ (x ) + µ (x )
Soft Computing 52 /
Basic fuzzy set operations: Equality and Power

Equality (A = B):

µA (x ) = µB (x )

Power of a fuzzy set Aα :

µAα (x ) =
{ µA (x )} α

If α < 1, then it is called dilation

If α > 1, then it is called
concentration

Soft Computing 53 /
Basic fuzzy set operations: Cartesian product

Caretsian Product (A × B):

µA×B (x, y ) = min{ µA (x ), µB

(y )

Example 3:
A(x) = {(x 1 , 0.2), (x2, 0.3), (x3, 0.5), (x4,
0.6)} y1 y2 y3

B(y) = {(y 1 , 0.8), (y2, 0.6), (y3, 0.3)} 

x1 0.2 0.2 0.2
x2
  0.3 0.3 
A × B = min{ µA (x ), µB 
x0.3
3 .5 0.5 
(y )} = 0x4 0.6 0.3
0.6 0.3

Soft Computing 54 /
Properties of fuzzy sets

Commutativity :

A∪B =
B∪A A∩B
= B∩A

Associativity :

A ∪ (B ∪ C) = (A ∪ B)
∪ C A ∩ (B ∩ C) = (A
∩ B) ∩ C

Distributivity :

A ∪ (B ∩ C) = (A ∪ B) ∩
(A ∪ C)
A ∩ (B ∪ C) = (A ∩ B) ∪
Soft(A ∩ C)
Computing 55 /
Properties of fuzzy sets
Idempotence :
A ∪ A =
A
A ∩ A =
∅A∪ ∅
= A A∩
Transitivity : ∅=∅
If A ⊆ B, B ⊆ C then A ⊆
C
Involution :

(Ac ) c = A
De Morgan’s law :

(A ∩ B) c = Ac ∪ Bc
(ASoft
∪ Computing
B) c = Ac ∩ Bc 56 /
Few Illustrations on Fuzzy
Sets

Soft Computing 57 /
Example 1: Fuzzy Set Operations

Let A and B are two fuzzy sets defined over a universe of

discourse X with membership functions µA(x ) and µB (x ),
respectively. Two MFs µA(x ) and µB (x ) are shown graphically.
µA(x)

a1 a2 µB(x) b1 a1 =b2 a2 =b3 a4

x
a3

a4 x

Soft Computing 58 /
Example 1: Plotting two sets on the same graph

Let’s plot the two membership functions on the

same graph

µB µA
µ

b1

a1

a2 b 4 a3 a 4 x

Soft Computing 59 /
Example 1: Union and Intersection
The plots of union A ∪ B and intersection A ∩ B are
shown in the following.

µB µA

b1

a1

a2 b 4 a3 a4 x
A B ( )x

A B ( )x
a2 b4
x b1 a1 a2 a3 a4
x

Soft Computing 60 /
Example 1: Intersection

The plots of union µA¯ (x ) of the fuzzy set A is shown in the

following.
A ( )x

 ( )x
A
a b a b
x x

Soft Computing 61 /
Fuzzy set operations: Practice

Consider the following two fuzzy sets A and B defined over a

universe of discourse [0,5] of real numbers with their
membership functions
µA (x ) = +x
1
x
and µB (x ) =
2−x
Determine the membership functions of the following and
draw them graphically.

i. A , B
ii. A ∪ B
iii. A ∩ B
iv. (A ∪ B) c [Hint: Use De’ Morgan law]

Soft Computing 62 /
Example 2: A real-life example

Two fuzzy sets A and B with membership functions µA(x )

and µB (x ), respectively defined as below.
A = Cold climate with µA (x ) as the MF.
B = Hot climate with µB (x ) as the M.F.

µA µB
1.0

0.5
µ

-15 -10 -5 0 5 10 15 20 25 30 35 40 45 50

Here, X being the universe of discourse representing entire

range of temperatures.

Soft Computing 63 /
Example 2: A real-life example

What are the fuzzy sets representing the

following?
1 Not cold climate

2 Not hold climate

3 Extreme
4 climate

Pleasant climate
Note: Note that ”Not cold climate” =
̸ ”Hot climate” and
vice-versa.

Soft Computing 64 /
Example 2 : A real-life example
Answer would be the
following.
1 Not cold climate

A with 1 − µA (x ) as the
2 MF. hot climate
Not
B with 1 − µB (x ) as the
3 MF.
Extreme climate
A ∪ B with µA∪B (x ) = max(µA(x ), µB (x )) as
4 the MF. climate
Pleasant
A ∩ B with µA∩B (x ) = min(µA(x ), µB (x )) as the MF.
The plot of the MFs of A ∪ B and A ∩ B are shown in the
following. Extreme Pleasant
1.0 climate
µA climate
1.0 µB
A B

A B
0.
5
µ

- -
15 10 -5 0 5 10 15 20 25 30 35 40 45 50
x
5 15 25 5 25
x x

Soft Computing 65 /
Few More on Membership
Functions

Soft Computing 66 /
Generation of MFs
Given a membership function of a fuzzy set representing a
linguistic hedge, we can derive many more MFs
representing several other linguistic hedges using the
concept of Concentration and Dilation.
Concentration:
Ak = [µA (x )]k ; k > 1
Dilation:
Ak = [µA (x )]k ; k < 1
Example : Age = { Young, Middle-aged, Old }
Thus, corresponding to Young, we have : Not young, Very
young, Not very young and so on.
Similarly, with Old we can have : old, very old, very very old,
extremely old etc.
Thus, Extremely old = (((old ) 2 ) 2 ) 2 and so on
Soft Computing
0.5 0.5 67 /
Linguistic variables and values

Young Middle- Old

Aged

Very
Old

Very young

0 30 60 100

X=
Age

µyoung (x ) = bell(x, 20, 2, 0)1+(

= 20
1
x 4
)
1
µold (x ) = bell(x, 30, 3, x 100
1+( −30 ) 6
100) =
µmiddle−aged = bell(x, 30, 60, 50)

Not young = µyoung (x ) = 1 − µyoung (x )

Young but not too young = µyoung (x ) ∩
µyoung (x ) Soft Computing 68 /
Any questions??

Soft Computing 69 /