INTRODUCTION TO FUZZY LOGIC,

CLASSICAL SETS AND FUZZY SETS

Why?
 Fuzzy set theory is an excellent mathematical tool to
handle the uncertainty arises due to vagueness.
 Problems in the real world become complex as an
element having uncertainty either in parameters or in
the situation.
 Probability theory is an effective tool to deal with
uncertainty but can be applied to only those situation
whose characteristics are based on random process.
Cont…
 Means in which the occurrence of events is strictly
determined by chance.
 In real world, a large class of problems in which
uncertainty may arises due to partial information or
conflicting information about the problem.
 Difference Between Classical
Set Theory & Fuzzy Set Theory
Classical set theory Fuzzy set theory
• Classes of objects with sharp • Classes of objects with un-
boundaries. sharp boundaries.

• A classical set is defined by • A fuzzy set is defined by its

crisp(exact) boundaries, i.e., ambiguous boundaries, i.e.,
there is no uncertainty about there exists uncertainty about
the location of the set the location of the set
boundaries. boundaries.

• Widely used in digital system • Used in fuzzy controllers.

design
FUZZY LOGIC
 Fuzzy Logic (FL) is a method of reasoning that
resembles human reasoning. The approach of FL
imitates the way of decision making in humans that
involves all intermediate possibilities between digital
values YES and NO.
 The conventional logic block that a computer can
understand takes precise input and produces a definite
output as TRUE or FALSE, which is equivalent to
human’s YES or NO.
 Fuzzy logic is the logic underlying approximate, rather
than exact, modes of reasoning.
Cont…
 Fuzzy logic is a form of many-valued logic; it deals with
reasoning that is approximate rather than fixed and exact. In
contrast with traditional logic theory, where binary sets have
two-valued logic: true or false, fuzzy logic variables may have
a truth value that ranges in degree between 0 and 1.
 Fuzzy logic has been extended to handle the concept of
partial truth, where the truth value may range between
completely true and completely false.
 Fuzzy logic is a set of mathematical principles for
knowledge representation and reasoning based on
degrees of membership.
 Fuzzy ≠ Probability
 Probability deals with uncertainty: a likelihood
 Fuzzy logic deals with ambiguity: a vagueness
EVOLUTION
Lotfi A. Zadeh, a professor of UC Berkeley in
California, soon to be known as the founder of fuzzy
logic observed that conventional computer logic was
incapable of manipulating data representing subjective
or vague human ideas such as "an attractive person" .
Fuzzy logic, hence was designed to allow
computers to determine the distinctions among
data with shades of gray, similar to the process of
human reasoning.
This theory proposed making the membership
function (or the values False and True) operate over
the range of real numbers [0.0, 1.0]. Fuzzy logic was
introduced to the world in 1965.
CLASSICAL SETS (CRISP SETS)
 Conventional or crisp sets are Binary. An element either
belongs to the set or does not. Eg. {True, False} or {1, 0}
Classical set theory
A Set is any well defined collection of distinct objects.
An object in a set is called an element or member of that
set.
Sets are defined by a simple statement,
Describing whether a particular element having a certain
property belongs to that particular set.
A = {a1,a2,a3,……,an}
If the elements ai (i = 1,2,3,….,n) of a set A are subset
of universal set X, then set A can be represented for all
elements x ϵ X by its characteristics function
µA(x) = 1 if x ϵ X otherwise 0
 OPERATIONS ON CRISP SETS

 UNION:

 INTERSECTION:

 COMPLEMENT:

 DIFFERENCE:
(5)Composition T
R  A  B, S  B  C , T  RoS  A  C
T  {(x, z) | x  A, y  B, z  C, (x, y) 
R, (y, z)  S}
The second component of R and first
component of S should be the same than
only composition is possible.
A={1,2,3,4}
B={a,b,c,d}
C={/,*,-,+}
R is a subset of AXB
R={(1,a)(2,a)(2,c)(3,a)(3,b)}
S is a subset of BXC
S={(a,+)(a,*)(c,+)(a,/)(b,-)}
RoS={(1,+),(1,*),(1,/),(2,+),(2,*),(2,/),(3,+),
(3,*),(3,/),(3,-)}
PROPERTIES OF CRISP SETS
The various properties of crisp sets are as follows:
Cont…
Fuzzy Set
 A Fuzzy set is a set whose elements have degrees of
membership. Fuzzy sets are an extension of the classical
notion of set (known as a Crisp Set).
 More mathematically, a fuzzy set is a pair (A, µA) where
A is a set and µA : A → [0, 1]. For all x ∈ A
 µA(x) is called the grade of membership of x. If µA(x) =
1, we say that x is Fully Included in (A, µA), and if µA(x)
= 0, we say that x is Not Included in (A, µA).
 If there exists some x ∈ A such that µA(x) = 1, we say
that (A, µA) is Normal. Otherwise, we say that (A, µA) is
Subnormal.
Fuzzy Set Operations
 Let A and B be fuzzy sets in the universe of discourse U. For a
given element x on the universe, the following function theoretic
operations of union, intersection and complement are defined
for fuzzy sets A and B on U.

 Let X = {g1, g2, g3, g4, g5} be the reference set of students.
 Let à be the fuzzy set of “smart” students, where “smart” is fuzzy

term.
Cont…
 Ã={(g1,0.4)(g2,0.5)(g3,1)(g4,0.9)(g5,0.8)}
 Here à indicates that the smartness of g1 is 0.4 and so

on
Given X to be the universe of discourse and à and Ḃ to be

fuzzy sets with µA(x) and µB(x) are their respective

membership
function, the fuzzy set operations are as follows:
Union:

µAU B(x) = max (µA(x), µB(x))

 A U B={​​x: x belongs to A or x belongs to B​and µAU B(x)
= max (µA(x), µB(x))}
A = {(x1,0.5),(x2,0.7),(x3,0)(x4,0.5)}
B = {(x1,0.8),(x2,0.2),(x3,1)}
A U B={(x1,0.8),(x2,0.7),(x3,1)}
 A ∩ B={​​x: x ∈ A and x ∈ B​& µ ∩ (x) = min (µ (x),
A B A

µB(x))}
A = {(x1,0.5),(x2,0.7),(x3,0)}
B = {(x1,0.8),(x2,0.2),(x3,1)}
A ∩ B={(x1,0.5),(x2,0.2),(x3,0)}
Cont…
Intersection:

µA B(x) = min (µA(x), µB(x))

Complement:

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

Containment

'If A ⊆ B, then XA(x) ≤ XB (x)

Cont…
Example:

A = {(x1,0.5),(x2,0.7),(x3,0)} B = {(x1,0.8),(x2,0.2),(x3,1)}
Union:

 A U B = {(x1,0.8),(x2,0.7),(x3,1)}
Because
 µAU B(x1) = max (µA(x1), µB(x1))
= max(0.5,0.8)
 = 0.8

 µAU B(x2) = 0.7 and µAU B(x3) = 1

Cont…
Example:

A = {(x1,0.5),(x2,0.7),(x3,0)} B = {(x1,0.8),(x2,0.2),(x3,1)}
Intersection:

 A  B = {(x1,0.5),(x2,0.2),(x3,0)}
Because
 µA B(x1) = min (µA(x1), µB(x1))
= max(0.5,0.8)
 = 0.5

 µA B(x2) = 0.2 and µA B(x3) = 0

Cont…
Example:

A = {(x1,0.5),(x2,0.7),(x3,0)}
Complement:
 Ac= {(x ,0.5),(x ,0.3),(x ,1)}
 1 2 3
Because

 µA(x1) =1- µA(x1)

= 1 – 0.5


 = 0.5

 µA(x2) = 0.3 and µA(x3) = 1

Other useful operations on Fuzzy
set
 Algebraic sum:

 Algebraic product:

 Bounded sum:

 Bounded difference:
Properties of Fuzzy set
 Fuzzy sets follow the same properties as crisp set except
for the law of excluded middle and law of contradiction.
 That is, for fuzzy set à Frequently used properties of fuzzy
sets are given as follows:
Classical Relations and
Fuzzy Relations
 Relations represent the mapping between sets and
connectives in logic.
 A classical binary relation represents the presence or
absence of a connection or interaction or association
between the elements of two sets.
 Fuzzy binary relations are a generalization of crisp binary
relations, and they allow various degrees of
relationship(association) between elements.
 In fuzzy binary relation, the degree of association is
represented by membership grades in the same way as
the degree of set membership is represented m a fuzzy
set.
Cartesian Product

29
Cont…

30
Cont…
 A={a1,a2} B={b1,b2} C={c1,c2}
AxBxC = {(a1,b1,c1),(a1,b1,c2),(a1,b2,c1),(a1,b2,c2),
(a2,b1,c1),(a2,b1,c2),(a2,b2,c1), (a2,b2,c2)}

31
OPERATIONS ON FUZZY
RELATIONS
Representation methods
R={((x1,y1),0.2), ((x2,y2),0.4),…}

(Crisp) (Fuzzy)

33
Cont…
 Digraph

(Crisp) (Fuzzy)

34
 R={(1,2)(2,4)(2,5)(3,6)}
Dom(R )={1,2,3}
Range(R)={2,4,5,6}
 R={((1,2),0.5),((2,4),0.6),((2,5),0.8),
((3,6),0.5)}
 Dom(R)={(1,0.5),(2,0.8),(3,0.5)}
 R={((1,2),0.5),((2,4),0.6),((2,4),0.8),
((3,6),0.5)}
 Range(R)={(2,0.5),(4,0.8),(6,0.5)}
 Operations on Fuzzy Relation
Operation of fuzzy relation
1) Union relation
  (x, y)  A  B
 R  S (x, y)  Max [R (x, y), S (x, y)]  R (x, y)  S (x, y)
2) Intersection relation
 R  S (x) = Min [R (x, y), S (x, y)] = R (x, y)  S (x, y)
3) Complement relation
  (x, y)  A  B
 R (x, y)  1 - R (x, y)
-1
4) Inverse relation R (y, x)  R (x, y)
 For all (x, y)  A  B,
SoR=(3*4)o(4*3)=(3*3)
{(1,alpha),
Ut(x1,z1)=Max[min(x1y1,y1z1),min(x1y2,y2z1
)]
(1,alpha)=max[min(1,a)(a,alpha)
Example

=>

=>

Composition of fuzzy