Part 4

INTRODUCTION TO
FUZZY LOGIC, CLASSICAL
SETS AND FUZZY SETS
FUZZY LOGIC

Fuzzy logic is the logic underlying approximate, rather than

exact, modes of reasoning.

It is an extension of multivalued logic: Everything, including

truth, is a matter of degree.

It contains as special cases not only the classical two-value logic

and multivalue logic systems, but also probabilistic logic.

A proposition p has a truth value

• 0 or 1 in two-value system,
• element of a set T in multivalue system,
• Range over the fuzzy subsets of T in fuzzy logic.
Boolean logic uses sharp distinctions.
Fuzzy logic reflects how people think.

Fuzzy logic is a set of mathematical principles for knowledge

representation and reasoning based on degrees of membership.
NEED OF FUZZY LOGIC
Based on intuition and judgment.

No need for a mathematical model.

Provides a smooth transition between members and nonmembers.

Relatively simple, fast and adaptive.

Less sensitive to system fluctuations.

Can implement design objectives, difficult to express mathematically, in

linguistic or descriptive rules.
CLASSICAL SETS (CRISP SETS)
Conventional or crisp sets are Binary. An element either belongs to the set or
does not.

{True, False}

{1, 0}
CRISP SETS
OPERATIONS ON CRISP SETS

UNION:

INTERSECTION:

COMPLEMENT:

DIFFERENCE:
PROPERTIES OF CRISP SETS
The various properties of crisp sets are as follows:
Two point crossover
FUZZY LOGIC THEN . . .
is particularly good at handling uncertainty, vagueness and
imprecision.
especially useful where a problem can be described
linguistically (using words).
Applications include:
– robotics
– washing machine
control
– nuclear reactors
– focusing a camcorder
– information retrieval
– train scheduling
158
FUZZY SETS
The shape you see is known as the membership
function

159
FUZZY SETS
Now we have added some possible values on the
height - axis

160
FUZZY SETS

Shows two membership functions:

‘tall’ and ‘short’

161
NOTATION

For any fuzzy set, A, the function µA represents the

membership function for which µA(x) indicates the
degree of membership of x (of the universal set X)
in set A. It is usually expressed as a number
between 0 and 1:

162
NOTATION
For the member, x, of a discrete set with membership µ we use
the notation µ/x . In other words, x is a member of the set to
degree µ. Discrete sets are written as:

A = µ1/x1 + µ2/x2 + .......... + µn/xn

Or

where x1, x2....xn are members of the set A and µ1, µ2, ....,
µn are their degrees of membership. A continuous fuzzy set
A is written as:

163
FUZZY SETS
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 µA(x) is known as fuzzification.
fuzzification.
A fuzzy set is either continuous or discrete.
Graphical representation of membership functions is very
useful.

164
FUZZY SETS - EXAMPLE

“numbers close to 1”

165
FUZZY SETS - EXAMPLE

Again, notice the overlapping of the sets reflecting the real world
more accurately than if we were using a traditional approach.

166
IMPRECISION

Words are used to capture imprecise notions, loose concepts or

perceptions.

167
OPERATIONS ON FUZZY SETS
PROPERTIES OF FUZZY SETS
RELATIONS
Relations represent mappings 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.
CRISP CARTESIAN PRODUCT
CRISP RELATIONS
CRISP BINARY RELATIONS

Examples of binary relations

OPERATIONS ON CRISP RELATIONS
PROPERTIES OF CRISP RELATIONS

The properties of crisp sets (given below) hold good for crisp relations as well.

Commutativity,
Associativity,
Distributivity,
Involution,
Idempotency,
DeMorgan’s Law,
Excluded Middle Laws.
COMPOSITION ON CRISP RELATIONS
FUZZY Relation
Let R be a fuzzy subset of M and S be a fuzzy subset of N. Then the Cartesian
product R × S is a fuzzy subset of N × M such that

Example:

Let R be a fuzzy subset of {a, b, c} such that R = a/1 + b/0.8 + c/0.2 and S be
a fuzzy subset of {1, 2, 3} such that S = 1/1 + 3/0.8 + 2/0.5. Then fuzzy
relation R x S is given by
FUZZY RELATION
OPERATIONS ON FUZZY RELATION
The basic operation on fuzzy sets also apply on fuzzy relations.
PROPERTIES OF FUZZY RELATIONS
The properties of fuzzy sets (given below) hold good for fuzzy relations as well.

Commutativity,
Associativity,
Distributivity,
Involution,
Idempotency,
DeMorgan’s Law,
Excluded Middle Laws.
COMPOSITION OF FUZZY RELATIONS
MEMBERSHIP
FUNCTIONS
CRISP MEMBERSHIP FUCNTIONS
Crisp membership functions (µ) are either one or zero.

Consider the example: Numbers greater than 10. The membership curve
for the set A is given by
REPRESENTING A DOMAIN IN FUZZY LOGIC
FUZZY MEMBERSHIP FUCNTIONS
The set B of numbers approaching 2 can be represented by the
membership function
LINGUISTIC VARIABLE

Let x be a linguistic variable with the label “speed”.

Terms of x, which are fuzzy sets, could be “positive low”, “negative high”
from the term set T:

T = {PostiveHigh, PositiveLow, NegativeLow,

NegativeHigh, Zero}

Each term is a fuzzy variable defined on the base variable which might be the
scale of all relevant velocities.
MEMBERSHIP FUCNTIONS
FEATURES OF MEMBERSHIP FUNCTIONS

CORE:

SUPPORT:

BOUNDARY:
FUZZIFICATION
Use crisp inputs from the user.

Determine membership values for all the relevant classes (i.e., in right
Universe of Discourse).
EXAMPLE - FUZZIFICATION
FUZZIFICATION OF HEIGHT
FUZZIFICATION OF WEIGHT
LAMBDA CUT FOR FUZZY SETS
LAMBDA CUT FOR FUZZY RELATIONS
DEFUZZIFICATION
DEFUZZIFICATION
Defuzzification is a mapping process from a space of fuzzy control actions
defined over an output universe of discourse into a space of crisp
(nonfuzzy) control actions.

Defuzzification is a process of converting output fuzzy variable into a

unique number.

Defuzzification process has the capability to reduce a fuzzy set into a crisp
single-valued quantity or into a crisp set; to convert a fuzzy matrix into a
crisp matrix; or to convert a fuzzy number into a crisp number.
METHODS OF DEFUZZIFICATION
Defuzzification is the process of conversion of a fuzzy quantity into a precise
quantity. Defuzzification methods include:

Max-membership principle,
Centroid method,
Weighted average method,
Mean-max membership,
Center of sums,
Center of largest area,
First of maxima, last of maxima.
FUZZY INFERENCE
SYSTEM
FUZZY INFERENCE SYSTEMS (FIS)
Fuzzy rule based systems, fuzzy models, and fuzzy expert systems are also
known as fuzzy inference systems.
The key unit of a fuzzy logic system is FIS.
The primary work of this system is decision-making.
FIS uses “IF...THEN” rules along with connectors “OR” or “AND” for making
necessary decision rules.
The input to FIS may be fuzzy or crisp, but the output from FIS is always a
fuzzy set.
When FIS is used as a controller, it is necessary to have crisp output.
Hence, there should be a defuzzification unit for converting fuzzy variables
into crisp variables along FIS.
BLOCK DIAGRAM OF FIS
TYPES OF FIS
There are two types of Fuzzy Inference Systems:

Mamdani FIS(1975)

Sugeno FIS(1985)
MAMDANI FUZZY INFERENCE SYSTEMS (FIS)
Fuzzify input variables:
• Determine membership values.

Evaluate rules:
• Based on membership values of (composite) antecedents.

Aggregate rule outputs:

• Unify all membership values for the output from all rules.

Defuzzify the output:

• COG: Center of gravity (approx. by summation).
SUGENO FUZZY INFERENCE SYSTEMS (FIS)
The main steps of the fuzzy inference process namely,

1. fuzzifying the inputs and

2. applying the fuzzy operator are exactly the same as in MAMDANI FIS.

The main difference between Mamdani’s and Sugeno’s methods is that Sugeno
output membership functions are either linear or constant.
SUGENO FIS
FUZZY EXPERT SYSTEMS
An expert system contains three major blocks:

Knowledge base that contains the knowledge specific to the domain of

application.

Inference engine that uses the knowledge in the knowledge base for
performing suitable reasoning for user’s queries.

User interface that provides a smooth communication between the user

and the system.
References

Principles of soft computing by S.N.Deepa and S.N. Shivanandan

Multi objective optimization using evlotuniory algorithms by
Kalyanmoy deo
Genetic algorithms in search ,optimization and machine learning by
Devid E.goldberg
Neural Networks and Fuzzy Systems by Bart Kosko
Neural Network ,Fuzzy Logic and Genetic Algorithm by
Rahshekhran and Pai
Note :1. Students are advised to refer online resources and
above mentioned books to get more information related to
soft computing
2. Figures, formulae and many slides are taken as it is
from the CD of book of soft computing techniques by
shivanandan and Deepa