Fuzzy Logic: Introduction

Sarvesh Maurya

Bennett University

Sarvesh Maurya Soft Computing Applications 01/04/2025 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= Relational algebra + Boolean algebra + Predicate
logic

Fuzzy logic deals with Fuzzy sets.

Sarvesh Maurya Soft Computing Applications 01/04/2025 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

Sarvesh Maurya Soft Computing Applications 01/04/2025 3 / 69

A brief history of Fuzzy logic

1 Dictionary meaning of fuzzy is not clear, noisy etc.

Example: Is the picture on this slide is fuzzy?
2 Antonym of fuzzy is crisp
Example: Are the chips crisp?

Sarvesh Maurya Soft Computing Applications 01/04/2025 4 / 69

Example : Fuzzy logic vs. Crisp logic

Yes or No
Crisp answer
True or False

Milk Yes

Water
A liquid
Crisp

Coca
No
Pepsi

Is the liquid
colorless?

Sarvesh Maurya Soft Computing Applications 01/04/2025 5 / 69

Example : Fuzzy logic vs. Crisp logic

May be

May not
be
Fuzzy answer Absolutel
y

Partiall
y

etc

Sarvesh Maurya Soft Computing Applications 01/04/2025 6 / 69

Example : Fuzzy logic vs. Crisp logic

Score

99
Extremely
 Ankit honest

 Ankush
 Santosh Very 75
honest
 Kavita Fuzzy
Honest at 55
 Nidhi times

Extremely 35
Is the dishonest
person
honest?

Sarvesh Maurya Soft Computing Applications 01/04/2025 7 / 69

Concept of fuzzy system

Fuzzy element(s)

Fuzzy set(s)
I
N
P Fuzzy rule(s)
U
T
Fuzzy implication(s)
(Inferences)
O
U
T
Fuzzy system P
U
T

Sarvesh Maurya Soft Computing Applications 01/04/2025 8 / 69

Example of fuzzy set

Let us discuss the fuzzy set. X =

All students in B.Tech Third year
S = All Good students.
G= All Bad students
S = { (s, g) | s ∈ X } and g(s) is a measurement of the goodness of the
student s.
G= {(s, b) | s ∈ X } and b(s) is a measurement of the badness of the student
s
Example:
S = { (student 1, 0.8), (student 2, 0.7), (student 3, 0.1), (student 4, 0.9) }
G={(student 1, 0.2), (student 2, 0.3), (student 3, 0.9), (student 4, 0.1)}
Sarvesh Maurya Soft Computing Applications 01/04/2025 9 / 69
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 el- 2. It is collection of or-
ements. dered pairs.
3. Inclusion of an el- 3. Inclusion of an el-
ement s ∈ X into S is ement s ∈ X into F is
crisp, that is, has strict fuzzy, that is, if present,
boundary yes or no. then with a degree of
membership.

Sarvesh Maurya Soft Computing Applications 01/04/2025 10 / 69

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 the case of a crisp set, the elements have 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 Bangalore Bombay Hyderabad Kharagpur Madras Delhi

DoM 0.95 0.90 0.80 0.01 0.65 0.75

How the cities of comfort can be judged?

Sarvesh Maurya Soft Computing Applications 01/04/2025 11 / 69

Example: Course evaluation in a crisp way

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

Sarvesh Maurya Soft Computing Applications 01/04/2025 12 / 69

Example: Course evaluation in a crisp way

F P D C B A EX
1

0
35 50 60 70 80 90 100

Sarvesh Maurya Soft Computing Applications 01/04/2025 13 / 69

Example: Course evaluation in a fuzzy way

F P D C B A EX
1

0
35 50 60 70 80 90 100

Sarvesh Maurya Soft Computing Applications 01/04/2025 14 / 69

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].

Sarvesh Maurya Soft Computing Applications 01/04/2025 15 / 69

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 ?

Sarvesh Maurya Soft Computing Applications 01/04/2025 16 / 69

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)}

Sarvesh Maurya Soft Computing Applications 01/04/2025 17 / 69

Membership function with discrete membership
values

The membership values may be discrete values.

Sarvesh Maurya Soft Computing Applications 01/04/2025 18 / 69

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 10
6 8

Number of children (X)

A = “Happy family”

Sarvesh Maurya Soft Computing Applications 01/04/2025 19 / 69

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 100
B

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

Sarvesh Maurya Soft Computing Applications 01/04/2025 20 / 69

Fuzzy terminologies: Support

Support: The support of a fuzzy set A is the set of all points x ∈ X

such that µA(x ) > 0

Sarvesh Maurya Soft Computing Applications 01/04/2025 21 / 69

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

Sarvesh Maurya Soft Computing Applications 01/04/2025 22 / 69

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

Sarvesh Maurya Soft Computing Applications 01/04/2025 23 / 69

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}.

Sarvesh Maurya Soft Computing Applications 01/04/2025 24 / 69

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}.

Sarvesh Maurya Soft Computing Applications 01/04/2025 25 / 69

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.

Sarvesh Maurya Soft Computing Applications 01/04/2025 26 / 69

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 composed of a single line segment only.
Membership function is Non-convex
convex Membership function

1.0 1.0

Sarvesh Maurya Soft Computing Applications 01/04/2025 27 / 69

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

Sarvesh Maurya Soft Computing Applications 01/04/2025 28 / 69

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.

Sarvesh Maurya Soft Computing Applications 01/04/2025 29 / 69

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

Open left Open right

Closed

Sarvesh Maurya Soft Computing Applications 01/04/2025 30 / 69

Fuzzy vs. Probability

Fuzzy: When we say about the certainty of a thing

Example: A patient comes to the doctor, and he has to be diagnosed so that

medicine can be prescribed.
The doctor prescribed a medicine with certainty 60% that the patient was
suffering from flu. So, the disease will be cured with certainty of 60% and
uncertainty of 40%. Here, other diseases with some other certainties maybe
instead of the flu.

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

Example: India will win the T20 tournament with a chance of 60%, which
means that out of 100 matches, India owns 60 matches.

Sarvesh Maurya Soft Computing Applications 01/04/2025 31 / 69

Prediction vs. Forecasting

The Fuzzy vs. Probability is analogical to Prediction vs. Forecasting

Prediction: When you start guessing about things.

Forecasting , on the other hand, is a learning process. It involves taking

the information from past jobs, which has been recorded and packed, and
applying it to new jobs to gain insights and make informed decisions.

The main difference:

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

Sarvesh Maurya Soft Computing Applications 01/04/2025 32 / 69

 Fuzzy Membership
Functions

Sarvesh Maurya Soft Computing Applications 01/04/2025 33 / 69

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 60
0 2 4 6 8 10

Number of children (X) Age (X)

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

Sarvesh Maurya Soft Computing Applications 01/04/2025 34 / 69

Fuzzy membership functions
So, membership function on a discrete universe, of course, is trivial.
However, a membership function in a continuous universe of discourse
needs special attention.
The following figures show a typical example of membership functions.

µ
µ

x x x

< triangular > < trapezoidal > < curve >

µ

x x

< non-uniform > < non-uniform >

Sarvesh Maurya Soft Computing Applications 01/04/2025 35 / 69

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
b−a if a ≤ x ≤ b
triangle(x; a, b, c) = c−x (1)
c−b if b ≤ x ≤ c
 0 if c ≤ x

1.0

a b c

Sarvesh Maurya Soft Computing Applications 01/04/2025 36 / 69

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

1.0

a b c d

Sarvesh Maurya Soft Computing Applications 01/04/2025 37 / 69

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+| x 1− c |2b

a

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

c-a c c+a

Sarvesh Maurya Soft Computing Applications 01/04/2025 38 / 69

Example: Generalized bell MFs

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

1.0

-1 0 1

Sarvesh Maurya Soft Computing Applications 01/04/2025 39 / 69

Generalized bell MFs: Different shapes

Changing a Changing b

Changing a
Changing a and b

Sarvesh Maurya Soft Computing Applications 01/04/2025 40 / 69

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 = a
0.5

Sarvesh Maurya Soft Computing Applications 01/04/2025 41 / 69

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

Sarvesh Maurya Soft Computing Applications 01/04/2025 42 / 69

Grading System

A fuzzy implementation will look like the following.

Bad poor Average Good Very Good Excellent

1
.8
.6
.4
.2
0
10 20 30 60
40 50 70 80 90

marks

You can decide a standard fuzzy MF for each of the fuzzy

garde.
Sarvesh Maurya Soft Computing Applications 01/04/2025 43 / 69
 Operations on Fuzzy Sets

Sarvesh Maurya Soft Computing Applications 01/04/2025 44 / 69

Basic fuzzy set operations: Union

Union (A ∪ B):

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

Example:
A = {(x1, 0.5), (x2, 0.1), (x3, 0.4)} and
B = {(x1, 0.2), (x2, 0.3), (x3, 0.5)};
C = A ∪ B = {(x1, 0.5), (x2, 0.3), (x3, 0.5)}

µA µB µB
µ µA µAUB

b q c b q c
a p x a p
x

Sarvesh Maurya Soft Computing Applications 01/04/2025 45 / 69

Basic fuzzy set operations: Intersection

Intersection (A ∩ B):

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

Example:
A = {(x1, 0.5), (x2, 0.1), (x3, 0.4)} and
B = {(x1, 0.2), (x2, 0.3), (x3, 0.5)};
C = A ∩ B = {(x1, 0.2), (x2, 0.1), (x3, 0.4)}

µA
µB
µ µAᴖB

x b q c p b q c
a p a x

Sarvesh Maurya Soft Computing Applications 01/04/2025 46 / 69

Basic fuzzy set operations: Complement

Complement (AC ):

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

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

q p x q
p x

Sarvesh Maurya Soft Computing Applications 01/04/2025 47 / 69

Basic fuzzy set operations: Products

Algebraic product or Vector product (A•B):

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

Scalar product (α × A):

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

Sarvesh Maurya Soft Computing Applications 01/04/2025 48 / 69

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∩BC (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) g B(x) |

µ|A(x )gB(x )| = max{0, µA(x ) + µB (x ) − 1}

Sarvesh Maurya Soft Computing Applications 01/04/2025 49 / 69

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

Sarvesh Maurya Soft Computing Applications 01/04/2025 50 / 69

Basic fuzzy set operations: Cartesian product

Caretsian Product (A × B):

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

Example 3:
A(x) = {(x1, 0.2), (x2, 0.3), (x3, 0.5), (x4, 0.6)}
B(y) = {(y1, 0.8), (y2, 0.6), (y3, 0.3)}
y1 y2 y3
 
xx21 0.2
0.30.2
0.30.2
0.3
A × B = min{µA(x ), µB (y )} 
x3  0.5 0.5 0.3 
= 
x4 0.6 0.6
0.3

Sarvesh Maurya Soft Computing Applications 01/04/2025 51 / 69

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) ∪ (A ∩ C)

Sarvesh Maurya Soft Computing Applications 01/04/2025 52 / 69

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
(A ∪ B)c = Ac ∩ Bc
Sarvesh Maurya Soft Computing Applications 01/04/2025 53 / 69
 Few Illustrations on Fuzzy
Sets

Sarvesh Maurya Soft Computing Applications 01/04/2025 54 / 69

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 µB(x) b1 a1=b2 a2=b3 a4

x
a2

a3

a4 x
Sarvesh Maurya Soft Computing Applications 01/04/2025 55 / 69
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 b4 a3 a4
x

Sarvesh Maurya Soft Computing Applications 01/04/2025 56 / 69

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 b4 a3 a4 x
A B (x)

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

Sarvesh Maurya Soft Computing Applications 01/04/2025 57 / 69

Example 1: Intersection

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

following.
A (x)

 A(x)
a b a b
x x

Sarvesh Maurya Soft Computing Applications 01/04/2025 58 / 69

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]

Sarvesh Maurya Soft Computing Applications 01/04/2025 59 / 69

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.

Sarvesh Maurya Soft Computing Applications 01/04/2025 60 / 69

Example 2: A real-life example

What are the fuzzy sets representing the following?

1 Not cold climate
2 Not hold climate
3 Extreme climate
4 Pleasant climate

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

Sarvesh Maurya Soft Computing Applications 01/04/2025 61 / 69

Example 2 : A real-life example
Answer would be the following.
1 Not cold climate
A with 1 − µA(x ) as the MF.
2
Not hot climate
B with 1 − µB (x ) as the MF.
3
Extreme climate
A ∪ B with µA∪B (x ) = max(µA(x ), µB (x )) as the MF.
4
Pleasant climate
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 climate Pleasant climate
1.0
µA µB
1.0
AB

AB
0.
5
µ

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

Sarvesh Maurya Soft Computing Applications 01/04/2025 62 / 69