SOFT COMPUTING

Subject Code:PCP7H010
Credit:3-0-0
7th Semester
Branch:ETC
By
Dr. Sakuntala Mahapatra
Dean (R &D), Professor and HOD
Dept. of Electronics & Telecommunication Engg.
TRIDENT ACADEMY OF TECHNOLOGY
BHUBANESWAR, ODISHA

@ Dr. Sakuntala Mahapatra 02/09/2020

 PPT CONTENT

FUZZY LOGIC SYSTEMS

CLASS-4
(MODULE-1I)
DATE:02/09/2020
TIME:12.15 PM-1.15 PM

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 2

Contents
• Basics of Fuzzy Logic Theory
• Crisp and Fuzzy Sets
• Crisp/Classical Set Theory
• Difference between Crisp Set and Fuzzy Set
• Fuzzy Set Theory

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 3

 BASICS OF FUZZY LOGIC THEORY
 Fuzzy Logic system can work with any type of
inputs whether it is imprecise, distorted or noisy
input information.
 The construction of Fuzzy Logic Systems is easy
and understandable.
 Fuzzy logic comes with mathematical concepts of
set theory and the reasoning of that is quite
simple.
 It provides a very efficient solution to complex
problems in all fields of life as it resembles human
reasoning and decision making.
 The algorithms can be described with little data,
so little memory is required.
@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 4
 BASICS OF FUZZY LOGIC THEORY
 It is a technique to embody human-like
thinkings into a control system.
 It may not be designed to give accurate
reasoning but it is designed to give
acceptable reasoning.
 It can emulate human deductive thinking,
that is, the process people use to infer
conclusions from what they know.
 Any uncertainties can be easily dealt with
the help of fuzzy logic.
@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 5
 BASICS OF FUZZY LOGIC THEORY

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 6

 BASICS OF FUZZY LOGIC THEORY
 RULE BASE: It contains the set of rules and the
IF-THEN conditions provided by the experts to
govern the decision making system, on the basis
of linguistic information. Recent developments in
fuzzy theory offer several effective methods for
the design and tuning of fuzzy controllers. Most of
these developments reduce the number of fuzzy
rules.
 FUZZIFICATION: It is used to convert inputs
i.e. crisp numbers into fuzzy sets. Crisp inputs are
basically the exact inputs measured by sensors
and passed into the control system for
processing, such as temperature, pressure, rpm‟s,
etc.
@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 7
 BASICS OF FUZZY LOGIC THEORY
 INFERENCE ENGINE: It determines the
matching degree of the current fuzzy input
with respect to each rule and decides which
rules are to be fired according to the input
field. Next, the fired rules are combined to
form the control actions.
 DEFUZZIFICATION: It is used to convert
the fuzzy sets obtained by inference engine
into a crisp value. There are several
defuzzification methods available and the
best suited one is used with a specific expert
system to reduce the error.
@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 8
 Crisp and Fuzzy Sets
 Fuzzy set and crisp set are the part of the distinct
set theories, where the fuzzy set implements
infinite-valued logic while crisp set employs bi-
valued logic.
 Previously, expert system principles were
formulated premised on Boolean logic where
crisp sets are used.
 But then scientists argued that human thinking
does not always follow crisp “yes”/”no” logic, and
it could be vague, qualitative, uncertain, imprecise
or fuzzy in nature.
 This gave commencement to the development of
the fuzzy set theory to imitate human thinking.

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 9

 Crisp and Fuzzy Sets

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 10

 Crisp and Fuzzy Sets

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 11

 Crisp and Fuzzy Sets

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 12

 Crisp/Classical Set Theory
Definition of A Crisp/Classical Set
 A set is an unordered collection of different
elements. It can be written explicitly by listing its
elements using the set bracket. If the order of the
elements is changed or any element of a set is
repeated, it does not make any changes in the set.
Example
 A set of all positive integers.
 A set of all the planets in the solar system.
 A set of all the states in India.
 A set of all the lowercase letters of the alphabet.

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 13

 Crisp/Classical Set Theory
Mathematical Representation of a Set
 A set is represented by listing all the
elements comprising it. The elements are
enclosed within braces and separated by
commas.
Example
 Set of vowels in English alphabet,
A = {a,e,i,o,u}
 Set of odd numbers less than 10,
B = {1,3,5,7,9}
@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 14
 Crisp/Classical Set Theory
Set Builder Notation
 In this form, the set is defined by specifying
a property that elements of the set have in
common. The set is described as, A =
{x:p(x)}
Example − The set {a,e,i,o,u} is written as
 A = {x:x is a vowel in English alphabet}
Example − The set {1,3,5,7,9} is written as
 B = {x:1 ≤ x < 10 and (x%2) ≠ 0}

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 15

 Crisp/Classical Set Theory

Member and Nonmember of a Set

 If an element x is a member of any set S,
it is denoted by x∈S and if an element y is
not a member of set S, it is denoted by
y∉S.
Example
 If S = {1,1.2,1.7,2},1 ∈ S but 1.5 ∉ S

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 16

 Crisp/Classical Set Theory
Cardinality of a Set
 Cardinality of a set S, denoted by |S|, where
|S| is the number of elements of the set.
 The number is also referred as the cardinal
number. If a set has an infinite number of
elements, its cardinality is ∞.
Example
 |{1,4,3,5}| = 4.
 |{1,2,3,4,5,…}| = ∞

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 17

 Crisp/Classical Set Theory
Cardinality of a Set
 If there are two sets X and Y, |X| =
|Y| denotes two sets X and Y having same
cardinality. It occurs when the number of
elements in X is exactly equal to the number
of elements in Y. In this case, there exists a
bijective function „f‟ from X to Y.
 |X| ≤ |Y| denotes that set X‟s cardinality is
less than or equal to set Y‟s cardinality. It
occurs when the number of elements in X is
less than or equal to that of Y. Here, there
exists an injective function „f‟ from X to Y.
@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 18
 Crisp/Classical Set Theory

Cardinality of a Set

 |X| < |Y| denotes that set X‟s cardinality is

less than set Y‟s cardinality. It occurs when
the number of elements in X is less than
that of Y. Here, the function „f‟ from X to Y
is injective function but not bijective.

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 19

 Crisp/Classical Set Theory
Types of Sets
 Sets can be classified into many types; some of which
are Universal, Finite, Infinite, Subset, Proper, Singleton
Set, etc.
Universal Set
 It is a collection of all elements in a particular context
or application. All the sets in that context or
application are essentially subsets of this universal set.
Universal sets are represented as U.
Example
 We may define U as the set of all animals on earth. In
this case, a set of all mammals is a subset of U, a set
of all fishes is a subset of U, a set of all insects is a
subset of U, and so on.
@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 20
 Crisp/Classical Set Theory
Finite Set
 A set which contains a definite number of
elements is called a Finite set.
Example
 S = {x|x ∈ N and 70 > x > 50}
Infinite Set
 A set which contains infinite number of
elements is called an Infinite set.
Example
 S = {x|x ∈ N and x > 10}
@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 21
 Crisp/Classical Set Theory
Subset
 A set X is a subset of set Y (Written as X ⊆ Y) if
every element of X is an element of set Y.
Example
 Let, X = {1,2,3,4,5,6} and Y = {1,2}. Here set Y is a
subset of set X as all the elements of set Y is in
set X. Hence, we can write Y ⊂ X.
Example
 Let, X = {1,2,3} and Y = {1,2,3}. Here set Y is a
subset (not a proper subset) of set X as all the
elements of set Y is in set X. Hence, we can write
Y⊆X.

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 22

 Crisp/Classical Set Theory
Proper Subset
 The term “proper subset” can be defined as
“subset of but not equal to”. A Set X is a
proper subset of set Y (Written as X ⊂ Y) if
every element of X is an element of set Y
and |X| < |Y|.
Example
 Let, X = {1,2,3,4,5,6} and Y = {1,2}. Here set
Y ⊂ X, since all elements in Y are contained
in X too and X has at least one element
which is more than set Y.

@ Dr. Sakuntala Mahapatra 02/09/2020 Fuzzy Logic Systems 23

 PPT CONTENT

FUZZY LOGIC SYSTEMS

CLASS-5
(MODULE-1I)
DATE:07/09/2020
TIME:12.15 PM-1.15 PM

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 24

 Crisp/Classical Set Theory
Empty Set or Null Set
 An empty set contains no elements. It is denoted
by Φ. As the number of elements in an empty set
is finite, empty set is a finite set. The cardinality of
empty set or null set is zero.
Example
 S = {x|x ∈ N and 7 < x < 8} = Φ
Singleton Set or Unit Set
 A Singleton set or Unit set contains only one
element.A singleton set is denoted by {s}.
Example
 S = {x|x ∈ N, 7 < x < 9} = {8}

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 25

 Crisp/Classical Set Theory
Equal Set
 If two sets contain the same elements, they are said
to be equal.
Example
 If A = {1,2,6} and B = {6,1,2}, they are equal as every
element of set A is an element of set B and every
element of set B is an element of set A.
Equivalent Set
 If the cardinalities of two sets are same, they are
called equivalent sets.
Example
 If A = {1,2,6} and B = {16,17,22}, they are equivalent
as cardinality of A is equal to the cardinality of B. i.e.
|A| = |B| = 3
@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 26
 Crisp/Classical Set Theory
Overlapping Set
 Two sets that have at least one common element are called
overlapping sets.
Example
 Let, A = {1,2,6} and B = {6,12,42}. There is a common
element „6‟, hence these sets are overlapping sets.
Disjoint Set
 Two sets A and B are called disjoint sets if they do not have
even one element in common. Therefore, disjoint sets have
the following properties

Example Let, A = {1,2,6} and B = {7,9,14}, there is not a

single common element, hence these sets are disjoint sets.

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 27

 Crisp/Classical Set Theory
Operations on Crisp/Classical Sets
 Set Operations include Set Union, Set Intersection,
Set Difference, Complement of Set, and Cartesian
Product.
Union
 The union of sets A and B (denoted by A ∪ B) is
the set of elements which are in A, in B, or in both
A and B. Hence, A ∪ B = {x|x ∈ A OR x ∈ B}.


@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 28

 Crisp/Classical Set Theory
Union
Example
 If A = {10,11,12,13} and B = {13,14,15},
then,
 A ∪ B = {10,11,12,13,14,15}
 The common element occurs only once.

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 29

 Crisp/Classical Set Theory
Intersection
 The intersection of sets A and B (denoted
by A ∩ B) is the set of elements which are
in both A and B.
 Hence, A ∩ B = {x|x ∈ A AND x ∈ B}.

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 30

 Crisp/Classical Set Theory
Intersection
Example
 If A = {10,11,12,13} and B = {13,14,15},
then,
 A ∩ B = {13}
 The common elements are taken only.

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 31

 Crisp/Classical Set Theory
Difference/ Relative Complement
 The set difference of sets A and B
(denoted by A–B) is the set of elements
which are only in A but not in B.
 Hence, A − B = {x|x ∈ A AND x ∉ B}.

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 32

 Crisp/Classical Set Theory
Difference/ Relative Complement
Example
 If A = {10,11,12,13} and B = {13,14,15},
 (A − B) = {10,11,12}.
 (B − A) = {14,15}.
 Here, we can see (A − B) ≠ (B − A)

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 33

 Crisp/Classical Set Theory
Complement of a Set
 The complement of a set A (denoted by
A′) is the set of elements which are not in
set A. Hence, A′ = {x|x ∉ A}.
 More specifically, A′ = (U−A) where U is
a universal set which contains all objects.

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 34

 Crisp/Classical Set Theory
Complement of a Set
Example
 If A = {x|x belongs to set of odd integers}
then A′ = {y|y does not belong to set of
odd integers}.

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 35

 Crisp/Classical Set Theory
Cartesian Product / Cross Product
 The Cartesian product of n number of sets
A1,A2,…An denoted as A1 × A2...× An can
be defined as all possible ordered pairs
(x1,x2,…xn) where x1 ∈ A1,x2 ∈ A2,…xn ∈
An
Example − If we take two sets A = {a,b} and
B = {1,2},
 The Cartesian product of A and B is written
as, A × B = {(a,1),(a,2),(b,1),(b,2)}
 And the Cartesian product of B and A is
written as, B × A = {(1,a),(1,b),(2,a),(2,b)}
@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 36
 Crisp/Classical Set Theory
Properties of Classical Sets
 Properties on sets play an important role
for obtaining the solution. Following are
the different properties of classical sets.
Commutative Property
 Having two sets A and B, this property
states;

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 37

 Crisp/Classical Set Theory
Associative Property
 Having three sets A, B and C, this
property states;

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 38

 Crisp/Classical Set Theory
Distributive Property
 Having three sets A, B and C, this
property states;

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 39

 Crisp/Classical Set Theory
Idempotency Property

 For any set A, this property states;

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 40

 Crisp/Classical Set Theory
Identity Property
 For set A and universal set X, this
property states;

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 41

 Crisp/Classical Set Theory
Transitive Property
 Having three sets A, B and C, the
property states;

Involution Property
 For any set A, this property states −

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 42

 Crisp/Classical Set Theory
De Morgan’s Law
 It is a very important law and supports in
proving tautologies and contradiction. This
law states;

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 43

 Crisp/Classical Set Theory
HOME TASK 1
Let U be the Universal Set defined as;
U={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,
19,20}.
Let A and B are two sets defined as;
A={2,5,7,8,10,13,15,16,18,19,20}
B={1,2,3,4,5,6,9,10,11,12,14,16,17,19}

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 44

 Crisp/Classical Set Theory
HOME TASK 1
Then Find out the following:
1. A ∪ B
2. A ∩ B
3. (A − B)
4. (B − A)
5. A′
6. B′

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 45

 Crisp/Classical Set Theory
HOME TASK 2
Let A and B are two crisp sets defined as;
A={R, S}.
B={7,10,18}
Then Find out the Cartesian Products as
follows:
1. A × B
2. B × A

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 46

 Crisp/Classical Set Theory
HOME TASK 3

 Give Examples one from each for an

Empty Set, Unit Set, Equal Set, Equivalent
Set, Overlapping Set, Disjoint Set.

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 47

 Concept of Fuzzy System

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 48

 Fuzzy Sets

 Fuzzy sets can be considered as an

extension and gross oversimplification of
classical sets.
 It can be best understood in the context
of set membership. Basically it allows
partial membership which means that it
contain elements that have varying
degrees of membership in the set.

@ Dr. Sakuntala Mahapatra 07/09/2020 Fuzzy Logic Systems 49

 PPT CONTENT

FUZZY LOGIC SYSTEMS

CLASS-6
(MODULE-1I)
DATE:09/09/2020
TIME:12.15 PM-1.15 PM

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 50

 Classical Set

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 51

 Fuzzy Set

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 52

 Difference between Classical Set
and Fuzzy Set

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 53

 Difference between Classical Set
and Fuzzy Set

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 54

 Difference between Classical Set
and Fuzzy Set

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 55

 Difference between Classical Set
and Fuzzy Set

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 56

 Crisp and Fuzzy Sets

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 57

 Difference between Classical Set
and Fuzzy Set

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 58

 Fuzzy Set

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 59

 Fuzzy Set
 Let us consider fuzzy set Ã, à = {(x, µÃ(x))| x Є
X} where µA(x) is called the membership function
for the fuzzy set Ã. X is referred to as the
universe of discourse.
 The membership function associates each
element x Є X with a value in the interval [0, 1].
 In fuzzy sets, each elements is mapped to [0,1] by
membership function. That is, μà : X €[0, 1],
where [0,1] means real numbers between 0 and 1
(including 0,1).
 Consequently, fuzzy set is with „vague boundary
set‟ comparing with crisp set.
@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 60
 Fuzzy Set
 Here, μà (x) is the “membership function”. Value of
this function is between 0 and 1.
 This value represents the “degree of membership”
(membership value) of element x in set Ã.
 The members of a fuzzy set are members to some
degree, known as a membership grade or degree of
membership.
 The membership grade is the degree of belonging to
the fuzzy set. The larger the number (in [0, 1]) the
more the degree of belonging. (N.B. This is not a
probability).
 The translation from x to µÃ(x) is known as
Fuzzification.

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 61

 Fuzzy Set
 In the fuzzy theory, fuzzy set à of
universe X is defined by function µÃ(x)
called the membership function of set Ã.
 We already discussed this point. µÃ(x): X
→ [0, 1], where µÃ(x) = 1 if x is totally in
Ã; µÃ(x) = 0 if x is not in Ã; 0 < µÃ(x) < 1
if x is partly in Ã.

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 62

 Fuzzy Set

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 63

 Fuzzy Set

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 64

 Fuzzy Set(Alternative Notation)

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 65

 Fuzzy Set(Alternative Notation)
 The fuzzy set à can be alternatively
denoted as follows: If X is discrete then Ã
= Σ μÃ(xi) / xi
 If X is continuous then à = ʃ μÃ(x) / x

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 66

 Fuzzy Set(Alternative Notation)

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 67

 Representation of a Fuzzy Set
Mathematical Concept

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 68

 Representation of a Fuzzy Set
 Let us now consider two cases of
universe of information and understand
how a fuzzy set can be represented.

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 69

 Representation of a Fuzzy Set

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 70

 Fuzzy Sets with Discrete Universes

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 71

Fuzzy Sets with Continuous Universes

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 72

 Fuzzy Set(Alternative Notation)

@ Dr. Sakuntala Mahapatra 09/09/2020 Fuzzy Logic Systems 73

 PPT CONTENT

FUZZY LOGIC SYSTEMS

CLASS-7
(MODULE-1I)
DATE:14/09/2020
TIME:12.15 PM-1.15 PM

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 74

 Fuzzy Set Theory
HOME TASK 4

Give Examples of Fuzzy Sets with;

 Discrete non-ordered Universe.
 Discrete ordered Universe.
 Continuous Universe.

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 75

 Fuzzy Set Theory
HOME TASK 5
 Represent the Alternative Notation of the
following Fuzzy Set.
1. A={(0,0.1),(1,0.3),(2,0.7),(3,1),(4,0.7),(5,0.3),
(6,0.1)}
2. C={(Delhi,0.5), (Mumbai,0.7),(Kolkata,0.6),
(Chennai,0.2),(Bhubaneswar,0.9)}

3. .

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 76

 Basic Concepts of Fuzzy Sets
(Some Definitions)

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 77

 Fuzzy Partition

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 78

 Fuzzy Partition

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 79

 Linguistic terms

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 80

 Support of a Fuzzy Set

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 81

 Support of a Fuzzy Set

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 82

 Core of a Fuzzy Set

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 83

 Core of a Fuzzy Set

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 84

 Empty Fuzzy Set

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 85

 Normality of a Fuzzy Set

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 86

 Normality of a Fuzzy Set

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 87

 Crossover point of a Fuzzy Set

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 88

 Crossover point of a Fuzzy Set

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 89

 Fuzzy Singleton

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 90

 Fuzzy Singleton

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 91

 Height of a Fuzzy Set

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 92

 Height of a Fuzzy Set

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 93

 α-cut and strong α -cut

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 94

 α-cut and strong α -cut

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 95

 Convexity of Fuzzy Sets

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 96

 Convexity of Fuzzy Sets

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 97

 Bandwidth

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 98

 Bandwidth

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 99

 Fuzzy Number

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 100

 Symmetry Fuzzy Set

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 101

 Open left, open right and closed
Fuzzy Sets

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 102

 Cardinality of a Fuzzy Set

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 103

 Fuzzy Set Theory
HOME TASK 6
 Let X be a Universal set of „Age‟ represented as;
 X={5,10,20,30,40,50,60,70,80,90}
 „young‟ and „old‟ are two Fuzzy Sets defined as;
 young={ (5, 1), (10, 1), (20, 0.8), (30, 0.5), (40,
0.2), (50, 0.1), (60, 0), (70, 0), (80,0), (90,0)}.
 old={ (5, 0), (10,0), (20, 0.1), (30, 0.2), (40,
0.4), (50, 0.6), (60, 0.8), (70, 1), (80,1), (90, 1)}.

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 104

 Fuzzy Set Theory
HOME TASK 6
Find out the following;
1. support (young)
2. support (old)
3. core (young)
4. core (old)
5. young 0.2
6. young' 0.2
7. young 0.8

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 105

 Fuzzy Set Theory
HOME TASK 6
Find out the following;
8. young' 0.8
9. young 1
10. old 0.4
11. old' 0.4
12. old 0.6
13. old 1
14. |young|
15. |old|

@ Dr. Sakuntala Mahapatra 14/09/2020 Fuzzy Logic Systems 106

 PPT CONTENT

FUZZY LOGIC SYSTEMS

CLASS-8
(MODULE-1I)
DATE:15/09/2020
TIME:12.15 PM-1.15 PM

@ Dr. Sakuntala Mahapatra 15/09/2020 Fuzzy Logic Systems 107

 MOST COMMONLY USED
MEMBERSHIP FUNCTIONS
IN ENGINEERING

@ Dr. Sakuntala Mahapatra 15/09/2020 Fuzzy Logic Systems 108

 Types of Membership Functions
Triangular MFs

@ Dr. Sakuntala Mahapatra 15/09/2020 Fuzzy Logic Systems 109

 Types of Membership Functions
Trapezoidal MFs

@ Dr. Sakuntala Mahapatra 15/09/2020 Fuzzy Logic Systems 110

 Types of Membership Functions
Gaussian MFs

Where „c‟ represents MFs Centre and represents the MFs width.

@ Dr. Sakuntala Mahapatra 15/09/2020 Fuzzy Logic Systems 111

 Types of Membership Functions
Generalized Bell MFs

Where „a‟ represents the width, „c‟ is the centre and „b‟ is the slope of
the MFs. If „b‟ is negative then the shape of the MF becomes an upside
down Bell.
@ Dr. Sakuntala Mahapatra 15/09/2020 Fuzzy Logic Systems 112
 Types of Membership Functions
Generalized Bell MFs

@ Dr. Sakuntala Mahapatra 15/09/2020 Fuzzy Logic Systems 113

 Types of Membership Functions
Generalized Bell MFs

@ Dr. Sakuntala Mahapatra 15/09/2020 Fuzzy Logic Systems 114

 Types of Membership Functions
Sigmoidal MFs

@ Dr. Sakuntala Mahapatra 15/09/2020 Fuzzy Logic Systems 115

 Close and asymmetric MFs based
on sigmoid functions

(a) Two sigmoid function y1 and y2; (b) A close MF obtained from |y1 – y2|;
(c) Two sigmoid functions y1 and y3; (d) a close MF obtained from y1y3.
@ Dr. Sakuntala Mahapatra 15/09/2020 Fuzzy Logic Systems 116
 Types of Membership Functions
Sigmoidal MFs

@ Dr. Sakuntala Mahapatra 15/09/2020 Fuzzy Logic Systems 117

 Types of Membership Functions

@ Dr. Sakuntala Mahapatra 15/09/2020 Fuzzy Logic Systems 118