General Definition

Fuzzy Logic - 1965 Lotfi Zadeh, Berkely

 superset of conventional (Boolean) logic that has been extended to

handle the concept of partial truth
 A form of knowledge representation suitable for notions that cannot
be defined precisely, but which depend upon their contexts.
 central notion of fuzzy systems is that truth values (in fuzzy logic) or
membership values (in fuzzy sets) are indicated by a value on the
range [0.0, 1.0], with 0.0 representing absolute Falseness and 1.0
representing absolute Truth.
 deals with real world vagueness

Basic concepts of fuzzy
The real world problems are with more non deterministic denominations
Fuzzy logic is used to solve problem with such non deterministic variables
(fuzzy variables)

Earlier computers are designed to solve precise problems

But majority of the real world problems are imprecise

To make the computers capable of solving imprecise problem we use fuzzy

logic
TRADITIONAL REPRESENTATION OF CRISP LOGIC

Slow Fast
Speed = 0 Speed = 1

Degree of crisp set is {0,1}

bool speed;
get the speed
if ( speed == 0) {
// speed is slow
}
else {
// speed is fast
}
 FUZZY LOGIC REPRESENTATION
Slowest
 For every problem
[ 0.0 – 0.25 ]
must represent in
terms of fuzzy sets.
Slow
 What are fuzzy sets? [ 0.25 – 0.50 ]

Fast
Here comes degree or
[ 0.50 – 0.75 ]
membership value
=[0,1]
Fastest
[ 0.75 – 1.00 ]
FUZZY LOGIC REPRESENTATION CONT.

Slowest Slow Fast Fastest

float speed;
get the speed
if ((speed >= 0.0)&&(speed < 0.25)) {
// speed is slowest
}
else if ((speed >= 0.25)&&(speed < 0.5))
{
// speed is slow
}
else if ((speed >= 0.5)&&(speed < 0.75))
{
// speed is fast
}
else // speed >= 0.75 && speed < 1.0
{
// speed is fastest
}
Properties of fuzzy set
Properties of fuzzy set cntd…
Fuzzy Relations
Membership function
Interval [0,1]
Cartesian space X × Y =>
Membership function and Fuzzification
 Fuzziness in a fuzzy set is characterized by its membership function.
 All information contained in a fuzzy set is described by its
membership function.
 Fuzzification: conversion of crisp set to fuzzy set by membership
functions
 Fuzzification: assigning membership value for the crisp quantities.
 Fuzzification
 Crisp quantity to fuzzy
 Crisp quantity – not actually deterministic at all
 Uncertainty arise by imprecision, ambiguity and vagueness. Such
variable is fuzzy and it is represented by membership function
 Real world example:
You should enter the class by 9:00AM, but there is some
deviation. Here comes imprecision
Figure shows one possible range of error

-5% +5% Time

Fuzzification: Intuition
ØDerived from the capacity of humans to develop membership
functions through their own innate intelligence and understanding.

Øinvolves contextual and semantic knowledge about an issue; it

can also involve linguistic truth values about this knowledge.
Example:

Membership function for the fuzzy variable temperature

Rank Ordering
ØPolling concept is used for assigning membership value
ØPreferences is determined by pairwise comparisons
ØThen determine the ordering
Rank Ordering Example

Solution:
The pairwise comparison is made among 1,000 people and their views
are summarized:

•So 515 preferred Siena compared to Palio.

•Totally ten comparison is made and gives a total 10,000.
•Percentage is calculated and ordering is performed.
•It is found Siena as the best.
Defuzzification
Fuzzy to crisp conversion

Need for defuzzification/rounding off:

Fuzzy results cannot be used as such to the applications.
Lambda Cuts for Fuzzy Sets
Consider a fuzzy set , then the lambda cut set can be denoted by A λ, where
λ ranges between 0 and 1 (0 ≤ λ ≤ 1).

The set Aλ is going to be a crisp set. This crisp set is called the lambda
cut set of the fuzzy set , where

Then Aλ = 1

Else Aλ = 0
Max-membership principle
- height method
This method is given by the expression,
Weighted average method
Formed by weighting each functions in the output by its
respective maximum membership value
Mean-max membership (middle of maxima)

Z* = a + b
2
Fuzzy Inference Systems
Fuzzy inference system is known by a number of names, such as
 fuzzy-rule-based system,
 fuzzy expert system,
 fuzzy model,
 fuzzy associative memory,
 fuzzy logic controller,
 simply fuzzy system.
Decision-making is an important part in the entire system.
FIS forms the rules, decision is made based on rules.
FIS is based on,
fuzzy set theory
fuzzy IF–THEN rules
fuzzy reasoning
Fuzzy Inference Systems
 FIS uses “IF. . . THEN. . . ” statements, and the connectors present are
“OR” or “AND” to make the necessary decision rules.
 FIS can take either fuzzy inputs or crisp inputs, but the output is fuzzy
 When the FIS is used as a controller, it is necessary to have a crisp
output. For this defuzzification is used




Fuzzy Inference Systems The Architecture of
Fuzzy Inference Systems

Inference
Input Fuzzifier Defuzzifier Output
Engine

Fuzzy
Knowledge base
Fuzzy Knowledge Base

The rule base and the database are jointly referred to as the knowledge
base.
•a rule base containing a number of fuzzy IF–THEN rules;
•a database which defines the membership functions of the fuzzy sets
used in fuzzy rules.
Fuzzifier

Converts the crisp input to a fuzzy value using the

membership functions stored in the fuzzy
knowledge base.
Inference Engine
It is a decision-making unit
Using If-Then type fuzzy rules converts the fuzzy input to the fuzzy output.
Defuzzifier

Converts the fuzzy output of the inference engine

to crisp using membership functions analogous to
the ones used by the fuzzifier.