NOTES OF AI

ARTIFICAL INTELLIGENCE
PART 6
 Fuzzy Systems

What are Fuzzy Systems ?

• Fuzzy Systems include Fuzzy Logic and Fuzzy Set Theory.

• Knowledge exists in two distinct forms :

− the Objective knowledge that exists in mathematical form is used in engineering problems;
and
− the Subjective knowledge that exists in linguistic form, usually impossible to quantify.
Fuzzy Logic can coordinate these two forms of knowledge in a logical way.

• Fuzzy Systems can handle simultaneously the numerical data and linguistic knowledge.

• Fuzzy Systems provide opportunities for modeling of conditions which are inherently imprecisely

defined.

• Many real world problems have been modeled, simulated, and replicated with the help of fuzzy

systems.

• The applications of Fuzzy Systems are many like : Information retrieval systems, Navigation system,

and Robot vision.

• Expert Systems design have become easy because their domains are inherently fuzzy and can now be
handled better; examples : Decision-support systems, Financial planners, Diagnostic system, and
Meteorological system.

Introduction

Any system that uses Fuzzy mathematics may be viewed as Fuzzy system.

The Fuzzy Set Theory - membership function, operations, properties and the relations have been
described in previous lectures. These are the prerequisites for understanding Fuzzy Systems. The
applications of Fuzzy set theory is Fuzzy logic which is covered in this section.
 Here the emphasis is on the design of fuzzy system and fuzzy controller in a closed–loop. The specific
topics of interest are :
− Fuzzification of input information,
− Fuzzy Inferencing using Fuzzy sets ,
− De-Fuzzification of results from the Reasoning process, and − Fuzzy controller
in a closed–loop.

Fuzzy Inferencing, is the core constituent of a fuzzy system. A block schematic of Fuzzy System is
shown in the next slide. Fuzzy Inferencing combines the facts obtained from the Fuzzification
with the fuzzy rule base and conducts the Fuzzy Reasoning Process.
• Fuzzy System

A block schematic of Fuzzy System is shown below.

Fuzzy
Rule Base

Input output
variables variables

X1 Fuzzy Y1
X2 Y2
Fuzzification Inferencing Defuzzification
Xn Ym

Membeship Function

Fig. Elements of Fuzzy System

Fuzzy System elements

− Input Vector : X = [x1 , x2, . . . xn ] T are crisp values, which are transformed into fuzzy sets in
the fuzzification block.

− Output Vector : Y = [y1 , y2, . . . ym ] T comes out from the defuzzification block, which
transforms an output fuzzy set back to a crisp value.
− Fuzzification : a process of transforming crisp values into grades of membership for linguistic
terms, "far", "near", "small" of fuzzy sets.
 − Fuzzy Rule base : a collection of propositions containing linguistic variables; the rules are
expressed in the form:
If (x is A ) AND (y is B ) . . . . . . THEN (z is C) where x, y and z represent
variables (e.g. distance, size) and A, B and Z are linguistic variables (e.g. `far',
`near', `small').
− Membership function : provides a measure of the degree of similarity of elements in the
universe of discourse U to fuzzy set.
− Fuzzy Inferencing : combines the facts obtained from the Fuzzification with the rule base and
conducts the Fuzzy reasoning process.
− Defuzzyfication: Translate results back to the real world values.
Fuzzy Logic

A simple form of logic, called a two-valued logic is the study of "truth tables" and logic circuits.
Here the possible values are true as 1, and false as 0.

This simple two-valued logic is generalized and called fuzzy logic which treats "truth" as a continuous
quantity ranging from 0 to 1.

Definition : Fuzzy logic (FL) is derived from fuzzy set theory dealing with reasoning that is
approximate rather than precisely deduced from classical two-valued logic.

− FL is the application of Fuzzy set theory.

− FL allows set membership values to range (inclusively) between 0 and 1.

− FL is capable of handling inherently imprecise concepts.

− FL allows in linguistic form, the set membership values to imprecise concepts like " slightly",
"quite" and "very".
Classical Logic

Logic is used to represent simple facts. Logic defines the ways of putting symbols together to
form sentences that represent facts. Sentences are either true or false but not both are called
propositions.
Examples :

Sentence Truth value Is it a Proposition ?

"Grass is green" "true" Yes
"2 + 5 = 5" "false" Yes
"Close the door" - No
 "Is it hot out side ?" - No
"x > 2" - No (since x is not defined)
"x = x" - No
(don't know what is "x" and "=" mean; "3 =
3" or say "air is equal to air" or "Water is
equal to water" has no meaning)

• Propositional Logic (PL)

A proposition is a statement - which in English is a declarative sentence and Logic defines the ways of
putting symbols together to form sentences that represent facts. Every proposition is either
true or false.
Propositional logic is also called boolean algebra.

Examples: (a) The sky is blue., (b) Snow is cold. , (c) 12 * 12=144 Propositional

logic : It is fundamental to all logic.

‡ Propositions are “Sentences”; either true or false but not both.

‡ A sentence is smallest unit in propositional logic

‡ If proposition is true, then truth value is "true"; else “false”

‡ Example ; Sentence "Grass is green";

Truth value “ true”;
Proposition “yes”
 ■

Statement, Variables and Symbols

Statement : A simple statement is one that does not contain any other statement as a part. A compound
statement is one that has two or more simple statements as parts called components.

Operator or connective : Joins simple statements into compounds, and joins compounds into larger

compounds.

Symbols for connectives

assertion P "p is true"

nagation ¬p ~ ! NOT "p is false"

conjunction p∧q · && & AND "both p and q are true"

disjunction Pvq || ‫׀‬ OR "either p is true, or
q is true, or both "

implication p→q ⊃ ⇒ if . . then "if p is true, then q is true" " p

implies q "

equivalence ↔ ≡ ⇔ if and only if "p and q are either both true

or both false"

■ Tr uth Value

The truth value of a statement is its truth or falsity , p is

either true or false, ~p is either true or false, p v q is either

true or false, and so on.

"T" or "1" means "true". and

"F" or "0" means "false"

Truth table is a convenient way of showing relationship between several propositions. The
truth table for negation, conjunction, disjunction, implication and equivalence are shown
below.

p q ¬ p ¬q p∧q pvq p→q p↔q q→p

T T F F T T T T T
T F F T F T F F T
F T T F F T T F F
 ■
F F T T F F T T T

Tautology

A Tautology is proposition formed by combining other propositions

(p, q, r, . . .) which is true regardless of truth or falsehood of p, q, r, . . . .

The important tautologies are :

(p→q) ↔ ¬ [p ∧ (¬q)] and (p→q) ↔ (¬p) ∨ q
A proof of these tautologies, using the truth tables are given below.
Tautologies (p→q) ↔ ¬ [p ∧ (¬q)] and (p→q) ↔ (¬p) ∨ q Table 1:
Proof of Tautologies
p q p→q ¬q p ∧ (¬q) ¬ [p ∧ (¬q)] ¬p (¬p) ∨ q
T T T F F T F T
T F F T T F F F
F T T F F T T T
F F T T F T T T

Note :
1. The entries of two columns p→q and ¬ [p ∧ (¬q)] are identical, proves the
tautology. Similarly, the entries of two columns p→q and (¬p) ∨ q are identical, proves
the other tautology.
2. The importance of these tautologies is that they express the membership function
for p→q in terms of membership functions of either propositions p and ¬q or ¬p and q.
■ Equivale nces

Between Logic , Set theory and Boolean algebra.

Some mathematical equivalence between Logic and Set theory and the correspondence
between Logic and Boolean algebra (0, 1) are given below.

Logic Boolean Algebra (0, 1) Set theory

T 1
F 0
∧ x ∩ , ∩
∨ + ∪ , U
¬ ′ ie complement (―)
↔ =
p, q, r a, b, c
■

Membership Functions obtain from facts

Consider the facts (the two tautologies)

(p→q) ↔ ¬ [p ∧ (¬q)] and (p→q) ↔ (¬p) ∨ q
Using these facts and the equivalence between logic and set theory, we can obtain membership
functions for µp→ q (x , y) .
From 1st fact : µp→q (x , y) = 1 - µ p ∩ q (x , y)
= 1 – min [µ p(x) , 1 - µ q (y)] Eq (1)

From 2nd fact : µp→q (x , y) = 1 - µ p Uq (x , y)

= max [ 1 - µ p (x) , µ q (y)] Eq (2)

Boolean truth table below shows the validation membership functions

Table-2 : Validation of Eq (1) and Eq (2)

max [ 1 - µ p (x) , µ q (y)] 1 – min [µ p(x) , 1 - µq

µ p(x) µ q(y) 1 - µ p (x) 1 - µ q (y) (y)]
1 1 0 0 1 1
1 0 0 1 0 0
0 1 1 0 1 1
0 0 1 1 1 1

Note :
1. Entries in last two columns of this table-2 agrees with the entries in table-1 for p→q ,
the proof of tautologies, read T as 1 and F as 0.
2. The implication membership functions of Eq.1 and Eq.2 are not the only ones that
give agreement with p→q. The others are :
µp→q (x , y) = 1 - µ p (x) (1 - µ q (y)) Eq (3)

µp→q (x , y) = min [ 1, 1 - µ p (x) + µ q (y)] Eq (4)

 ■

Modus Ponens and Modus Tollens

In traditional propositional logic there are two important inference rules, Modus Ponens and
Modus Tollens.
Modus Ponens
Premise 1 : " x is A "
Premise 2 : " if x is A then y is B " ; Consequence : " y is B " Modus Ponens is
associated with the implication " A implies B " [A→B]
In terms of propositions p and q, the Modus Ponens is expressed as
(p ∧ (p → q)) → q
Modus Tollens
Premise 1 : " y is not B "
Premise 2 : " if x is A then y is B " ; Consequence : " x is not A "
In terms of propositions p and q, the Modus Tollens is expressed as
(¬ q ∧ (p → q)) → ¬ p
Fuzzy Logic

Like the extension of crisp set theory to fuzzy set theory, the extension of
crisp logic is made by replacing the bivalent membership functions of the crisp logic with the fuzzy
membership functions.

In crisp logic, the truth value acquired by the proposition are 2-valued, namely true as 1 and
false as 0.

In fuzzy logic, the truth values are multi-valued, as absolute true, partially true, absolute false
etc represented numerically as real value between 0 to 1.

Note : The fuzzy variables in fuzzy sets, fuzzy propositions, fuzzy relations etc are represented
~
usually using symbol ~ as but for the purpose of P easy to write it is always represented

as P .
 •
Recaps

01 Membership function µ A (x) describes the membership of the elements x of the base set X in the fuzzy set A .

02 Fuzzy Intersection operator ∩ ( AND connective ) applied to two fuzzy sets A

and B with the membership functions µ A (x) and µ B (x) based on min/max operations is µ A ∩ B =
min [ µ A (x) , µ B (x) ] , x ∈ X (Eq. 01)

03 Fuzzy Intersection operator ∩ ( AND connective ) applied to two fuzzy sets A

and B with the membership functions µ A (x) and µ B (x) based on algebraic product is µ A ∩ B = µ A
(x) µ B (x) , x ∈ X (Eq. 02)

04 Fuzzy Union operator U ( OR connective ) applied to two fuzzy sets A and B

with the membership functions µ A (x) and µ B (x) based on min/max
operations is µ A U B = max [ µ A (x) , µ B (x) ] , x ∈ X (Eq. 03)

05 Fuzzy Union operator U ( OR connective ) applied to two fuzzy sets A and B

with the membership functions µ A (x) and µ B (x) based on algebraic sum is µ A U B = µ A (x) + µ B
(x) - µ A (x) µ B (x) , x ∈ X (Eq. 04)
06 Fuzzy Compliment operator ( ― ) ( NOT operation ) applied to fuzzy set A

with the membership function µ A (x) is µ A= 1 - µ A (x) , x ∈ X (Eq. 05)

07 Fuzzy relations combining two fuzzy sets by connective "min operation" is an operation by cartesian product R

: X x Y → [0 , 1]. µ R(x,y) = min[µ A (x), µ B (y)] (Eq. 06) or µ R(x,y) = µ A (x) µ B (y) (Eq. 07)

Example : Relation R between fruit colour x R and maturity grade Yx V h-m m

y characterized by base set linguistic colorset X = {green, yellow, G 1 0.5 0.0

Y 0.3 1 0.4
red} maturity grade as Y = {verdant, half-mature, mature}
R 0 0.2 1

08 Max-Min Composition - combines the fuzzy relations

variables, say (x , y) and (y , z) ; x ∈ A , y ∈ B , z ∈ C . consider the relations :

R1(x , y) = { ((x , y) , µR1 (x , y)) | (x , y) ∈ A x B }
R2(y , z) = { ((y , y) , µR1 (y , z)) | (y , z) ∈ B x C } The domain of R1 is A x B and the domain
of R2 is B x C max-min composition denoted by R1 ο R2 with membership function µ R1 ο R2
R1 ο R2 = { ((x , z) , (min max (µR1 (x , y) , µR2 (y , z))))} ,
y
(x , z) ∈AxC, y∈B (Eq. 08)
Thus R1 ο R2 is relation in the domain A x C

•
Fuzzy Propositional

A fuzzy proposition is a statement P which acquires a fuzzy truth value T(P) .

 Example :
P : Ram is honest
T(P) = 0.8 , means P is partially true.

T(P) = 1 , means P is absolutely true.

•
Fuzzy C onnectives

The fuzzy logic is similar to crisp logic supported by connectives.

Table below illustrates the definitions of fuzzy connectives.
Table : Fuzzy Connectves
Connective Symbols Usage Definition
Nagation ¬ ¬P 1 – T(P)
Disjuction ∨ P∨ Q Max[T(P) , T(Q)]
Conjuction ∧ P∧ Q min[T(P) , T(Q)]
Implication ⇒ P⇒ Q ¬P ∨ Q = max (1-T(P), T(Q)]

Here P , Q are fuzzy proposition and T(P) , T(Q) are their truth values.
− the P and Q are related by the ⇒ operator are known as antecedents and consequent
respectively.
− as crisp logic, here in fuzzy logic also the operator ⇒ represents IF-THEN statement like,
IF x is A THEN y is B, is equivalent to R = (A x B)
U (¬ A x Y)
the membership function of R is given by µR (x , y) = max [min
(µA (x) , µB (y)) , 1 − µA (x)] − For the compound implication statement
like
IF x is A THEN y is B, ELSE y is C is equivalent to
R = (A x B) U (¬ A x C) the membership function
of R is given by
µR (x , y) = max [min (µA (x) , µB (y)) , min (1 − µA (x), µC (y))]
Example 1 : (Ref : Previous slide)

P : Mary is efficient , T(P) = 0.8 ,

Q : Ram is efficient , T(Q) = 0.65 ,

¬ P : Mary is efficient , T(¬ P) = 1 − T(P) = 1− 0.8 = 0.2 P ∧ Q : Mary is

efficient and so is Ram, i.e.

 T(P ∧ Q) = min (T(P), T(Q)) = min (0.8, 0.65)) = 0.65 P ∨ Q : Either

Mary or Ram is efficient i.e.

T(P ∨ Q) = max (T(P), T(Q)) = max (0.8, 0.65)) = 0.8 P ⇒ Q : If Mary is

efficient then so is Ram, i.e.

T(P ⇒ Q) = max (1− T(P), T(Q)) = max (0.2, 0.65)) = 0.65

Example 2 : (Ref : Previous slide on fuzzy connective)

Let X = {a, b, c, d} ,
A = {(a, 0) (b, 0.8) (c, 0.6) (d, 1)}
B = {(1, 0.2) (2, 1) (3, 0.8) (4, 0)}
C = {(1, 0) (2, 0.4) (3, 1) (4, 0.8)}
Y = { 1, 2, 3, 4} the universe of discourse could be viewed as
{ (1, 1) (2, 1) (3, 1) (4, 1) }
i.e., a fuzzy set all of whose elements x have µ(x) = 1

Determine the implication relations

(i) If x is A THEN y is B
(ii) If x is A THEN y is B Else y is C Solution
To determine implication relations (i) compute :
The operator ⇒ represents IF-THEN statement like,
IF x is A THEN y is B, is equivalent to R = (A x B) U (¬ A x Y) and the membership function
R is given by
µR (x , y) = max [min (µA (x) , µB (y)) , 1 − µA (x)]
Fuzzy Intersection A x B is defined as : Fuzzy Intersection ¬A x Y is defined as :
for all x in the set X, for all x in the set X
(A ∩ B)(x) = min [A(x), B(x)], (¬A ∩ Y)(x) = min [A(x), Y(x)],

B1 2 3 4 y 1 2 3 4
A A
a 0 0 0 0 a 1 1 1 1
b 0.2 0.2 0.2 0.2
A x B = b 0.2 0.8 0.8 0 ¬A x Y = c 0.2 0.6 0.6 0 d 0.2 1 0.8 0
c 0.4 0.4 0.4 0.4
d 0 0 0 0
Fuzzy Union is defined as (A ∪ B)(x) = max [A(x), B(x)] for all x

∈ X Therefore R = (A x B) U (¬ A x Y) gives
 yx 1 2 3 4

a 1 1 1 1

R = b 0.2 0.8 0.8 0

c 0.4 0.6 0.6 0.4
d 0.2 1 0.8 0

This represents If x is A THEN y is B ie T(A ⇒ B) = max (1- T(A), T(B))

To determine implication relations (ii) compute : (Ref : Previous slide)

Given X = {a, b, c, d} ,
A = {(a, 0) (b, 0.8) (c, 0.6) (d, 1)}
B = {(1, 0.2) (2, 1) (3, 0.8) (4, 0)}
C = {(1, 0) (2, 0.4) (3, 1) (4, 0.8)}

Here, the operator ⇒ represents IF-THEN-ELSE statement like,

IF x is A THEN y is B Else y is C, is equivalent to
R = (A x B) U (¬ A x C) and the membership
function of R is given by
µR (x , y) = max [min (µA (x) , µB (y)) , min(1 − µA (x), µC (y)]

Fuzzy Intersection A x B is defined as : Fuzzy Intersection ¬A x Y is defined as : for all x in the set X,
for all x in the set X
(A ∩ B)(x) = min [A(x), B(x)], (¬A ∩ C)(x) = min [A(x), C(x)],

B1 2 3 4 yA1 2 3 4
A
a 0 0 0 0 a 0 0.4 1 0.8

A x B = b 0.2 0.8 0.8 0 ¬A x C = c 0.2 0.6 0.6 0 d 0.2 1 0.8 0 b 0.2 0.2 0.2 0.2
c 0.4 0.4 0.4 0.4
d 0 0 0 0
Fuzzy Union is defined as (A ∪ B)(x) = max [A(x), B(x)] for all x ∈ X Therefore

R = (A x B) U (¬ A x C) gives
 yx 1 2 3 4

a 1 1 1 1

R = b 0.2 0.8 0.8 0

c 0.4 0.6 0.6 0.4
d 0.2 1 0.8 0

This represents If x is A THEN y is B Else y is C

• Fuzzy Quantifiers

In crisp logic, the predicates are quantified by quantifiers.

Similarly, in fuzzy logic the propositions are quantified by quantifiers.
There are two classes of fuzzy quantifiers :
− Absolute quantifiers and
− Relative quantifiers Examples :

Absolute quantifiers Relative quantifiers

round about 250 almost

much greater than 6 about some where around 20
most
Fuzzification

The fuzzification is a process of transforming crisp values into grades of membership for linguistic terms
of fuzzy sets.
The purpose is to allow a fuzzy condition in a rule to be interpreted.

• Fuzzification of the car speed

Example 1 : Speed X0 = 70km/h

Fig below shows the fuzzification of the car speed to characterize a
low and a medium speed fuzzy set.
 Low Medium
1
µ Characterizing five grades, Very
.8 µA µB low, low, medium, high and very
high speed fuzzy set
.6

.4

.2
Given car speed value X0=70km/h : grade
0
20 40 60 80 100 120 140 µA(x0) = 0.75 belongs to fuzzy low, and grade
Speed X0 =7 0km/h
µB(x0) = 0.25 belongs to fuzzy medium
Characterizing two grades, low and medium
speed fuzzy set

Example 2 : Speed X0 = 40km/h

Medium
µ V Low Low High V High
1

.8
Given car speed value X0=40km/h : grade
.6
µA(x0) = 0.6 belongs to fuzzy low, and grade
.4
µB(x0) = 0.4 belongs to fuzzy medium.
.2

0
10 20 30 40 50 60 70 80 90 00
Speed X0 =4 0km/h
Fuzzy Inference

Fuzzy Inferencing is the core element of a fuzzy system.

Fuzzy Inferencing combines - the facts obtained from the fuzzification with the rule base, and then
conducts the fuzzy reasoning process.

Fuzzy Inference is also known as approximate reasoning.

Fuzzy Inference is computational procedures used for evaluating linguistic descriptions. Two
important inferring procedures are
− Generalized Modus Ponens (GMP)
− Generalized
Modus Tollens (GMT)
•
Generalized Modus Ponens (GMP)

This is formally stated as

 If x is A THEN y is B
x is ¬A

y is ¬B where A , B , ¬A , ¬B are fuzzy

terms.

Note : Every fuzzy linguistic statements above the line is analytically known and what is below
the line is analytically unknown.

To compute the membership function ¬B , the max-min composition of fuzzy set ¬A with
R(x , y) which is the known implication relation (IF-THEN) is used. i.e. ¬B = ¬A ο R(x, y)

In terms of membership function

µ ¬B (y) = max (min ( µ ¬A (x) , µR (x , y))) where µ ¬A (x) is the

membership function of ¬A ,
µR (x , y) is the membership function of the implication relation and µ ¬B (y) is the
membership function of ¬B
•
Generalized Modus Tollens (GMT)

This is formally stated as

If x is A THEN y is B
y is ¬B

x is ¬A where A , B , ¬A , ¬B are fuzzy

terms.

Note : Every fuzzy linguistic statements above the line is analytically known and what is below
the line is analytically unknown.

To compute the membership function ¬A , the max-min composition of fuzzy set ¬B

with R(x , y) which is the known implication relation (IF-THEN) is used. i.e. ¬A = ¬B ο
R(x, y)

In terms of membership function

 µ ¬A (y) = max (min ( µ ¬B (x) , µR (x , y))) where µ ¬B (x) is the
membership function of ¬B ,
µR (x , y) is the membership function of the implication relation and
µ ¬A (y) is the membership function of ¬A

Example :

Apply the fuzzy Modus Ponens rules to deduce Rotation is quite slow?
Given :
(i) If the temperature is high then then the rotation is slow.
(ii) The temperature is very high.

Let H (High) , VH (Very High) , S (Slow) and QS (Quite Slow) indicate the associated fuzzy sets.
Let the set for temperatures be X = {30, 40, 50, 60, 70, 80, 90, 100} , and
Let the set of rotations per minute be Y = {10, 20, 30, 40, 50, 60} and
H = {(70, 1) (80, 1) (90, 0.3)}
VH = {(90, 0.9) (100, 1)}
QS = {10, 1) (20, 08) }
S = {(30, 0.8) (40, 1) (50, 0.6)

To derive R(x, y) representing the implication relation (i) above, compute

R (x, y) = max (H x S , ¬ H x Y)

10 20 30 40

30 1 1 1
1
10 20 30 40 50 60 40 1 1 1
1
30 0 0 0 0 50 1 1 1
0 0 1
40 0 0 0 0 60 1 1 1
0 0 1
50 0 0 0 0
R(x,Y) = 70 0 0 0.8
0 0 60 0 0 1
0 0 0 80 0 0 0.8 1
0 90 0.7 0.7 0.7 0.7
H x S = 70 0 0 0.8 1 0.6 0 100 1 1 1 1
80 0 0 0.8 1 0.6 0
90 0 0 0.3 0.3 0.3 0
100 0 0 0 0 0 0

10 20 30 40 50 60
 100 1 1 1 1 1 1
30 1 1 1 1 1
1
40 1 1 1 1 1 50 60
1
1 1
50 1 1 1 1 1
1 1
1
1 1
60 1 1 1 1 1
1 1 1
HxY= 0.6 0
70 0 0 0 0 0 0
80 0 0 0 0 0 0.6 0
0 0.7 0.7
90 0.7 0.7 0.7 0.7 0.7 0.7 1 1

QS = VH ο R (x, y)
To deduce Rotation is quite slow, we make use of the composition rule
= [1 1 1 1 1 1 ]
10 20 30 40 50 60

30 1 1 1 1 1 1
40 1 1 1 1 1 1
50 1 1 1 1 1 1
60 1 1 1 1 1 1
= [0 0 0 0 0 0 0.9 1] x 70 0 0 0 0 0 0
80 0 0 0 0 0 0
90 0.7 0.7 0.7 0.7 0.7 0.7
100 1 1 1 1 1 1

Fuzzy Rule Based System

The fuzzy linguistic descriptions are formal representation of systems made through fuzzy IF-THEN rule.
They encode knowledge about a system in statements of the form :

IF (a set of conditions) are satisfied THEN (a set of consequents) can be inferred.

IF (x1 is A1, x2 is A2, xn is An ) THEN (y1 is B1, y2 is B2, yn is Bn)

where linguistic variables xi, yj take the values of fuzzy sets Ai and Bj respectively.
Example :
IF there is "heavy" rain and "strong" winds THEN there must
"severe" flood warnings.

Here, heavy , strong , and severe are fuzzy sets qualifying the variables rain, wind, and flood warnings
respectively.
 A collection of rules referring to a particular system is known as a fuzzy rule base. If the
conclusion C to be drawn from a rule base R is the conjunction of all the individual consequents C
i of each rule , then
C = C1 ∩ C2 ∩ . . . ∩ Cn where

µc (y ) = min ( µc1(y ), µc2(y ) , µcn(y )) , ∀y∈ Y where Y is universe

of discourse.
On the other hand, if the conclusion C to be drawn from a rule base R is the disjunction of the
individual consequents of each rule, then C = C1 U C2 U . . . U Cn where µc (y ) = max
( µc1 (y ), µc2(y ) , µcn (y )) , ∀ y ∈ Y where Y is universe of discourse.

Defuzzification

In many situations, for a system whose output is fuzzy, it is easier to take a crisp decision if the output is
represented as a single quantity. This conversion of a single crisp value is called Defuzzification.

Defuzzification is the reverse process of fuzzification.

The typical Defuzzification methods are

− Centroid method,

− Center of sums,
− Mean of maxima.

Centroid method
It is also known as the "center of gravity" of area method.
It obtains the centre of area (x*) occupied by the fuzzy set .
For discrete membership function, it is given by

Σ
xi µ (xi)
i=1 x* =
where n

Σ
µ (xi)
i=1

n represents the number elements in the sample, and xi are the

elements, and µ (xi) is the membership function.