Scribd
Upload
6 views11 pages

CO1 - Fuzzification and Inference - 06

The document outlines a session on Fuzzification within a Soft Computing course, focusing on the concepts of fuzzification and inference methods. It includes instructional objectives, learning outcomes, and various propositional logic rules such as Modus Ponens and Modus Tollens. Additionally, it discusses important inferring procedures like Generalized Modus Ponens and Generalized Modus Tollens, along with self-assessment and terminal questions to evaluate understanding of the material.

Uploaded by

reeni2819
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views11 pages

CO1 - Fuzzification and Inference - 06

The document outlines a session on Fuzzification within a Soft Computing course, focusing on the concepts of fuzzification and inference methods. It includes instructional objectives, learning outcomes, and various propositional logic rules such as Modus Ponens and Modus Tollens. Additionally, it discusses important inferring procedures like Generalized Modus Ponens and Generalized Modus Tollens, along with self-assessment and terminal questions to evaluate understanding of the material.

Uploaded by

reeni2819
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

FUZZIFICATION

Course: Soft Computing


Course Code:
22AIP3202

CO - 1 Session - 6
AIM OF THE SESSION

To familiarize students with the concepts of Fuzzification


To make students understand the concepts behind inference

INSTRUCTIONAL OBJECTIVES

This unit is designed to:


1. Demonstrate fuzzification and inference methods
2. Describe the ways of using inference methods
3. List out the techniques of fuzzification
4. Demonstrate the process of inferencing

LEARNING OUTCOMES
At the end of this unit, you should be able to:
1. Define the fuzzification and inferencing methods
2. Summarize the techniques of fuzzification and inferencing
3. Describe ways used for inferencing from fuzzy implications
Propositional logic

Various propositional logic

Propositional
 Modus Ponens : P, P =⇒ Q, ⇔ Q

 Modus Tollens : P =⇒ Q, ¬Q ⇔,
¬P

logic
 Chain rule : P =⇒ Q, Q =⇒ R ⇔,
P =⇒ R
 Generalized Modus Ponens
(GMP)
 Generalized Modus Tollens
(GMT)
Fuzzy rules

Fuzzy logic to infer a fuzzy rule

Other fuzzy rules

C∨D

∼ H =⇒ (A∧ ∼ B)

C ∨ D =⇒∼ H

(A∧ ∼ B) =⇒ (R ∨ S)
important inferring procedures

Generalized Modus Ponens (GMP)


. If x is A Then y is B
x is A′
————————————
y is B′

Generalized Modus Tollens (GMT)

If x is A Then y is B
′
y is B
— — — — — — — — — — — —
′
x is A
Generalized Modus Ponens (GMP)
′
. ′
Here, A, B, A and B are fuzzy sets

′ ′
To compute the membership function A and B the max-min composition
′ ′
of fuzzy sets B and A ,respectively with R(x, y ) (which is the known
implication relation) is to be used. Thus,

′ ′
B = A ◦ R(x, y )
 A′ = B′ ◦ R(x, y )
 µB (y ) = max [min(µA′ (x ), µR (x,
y ))]
 µA (x ) = max [min(µB ′ (y ), µR (x,
y ))]
Generalized Modus Ponens (GMP)

Note:

P : If x is A then y is B
X = {x1, x2, x3} and Y = {y1, y2}, respectively.

Also, let us consider the following.

A = {(x1, 0.5), (x2, 1), (x3, 0.6)}

B = {(y1, 1), (y2, 0.4)}

We are to find B′ = A′ ◦ R(x, y ) where R(x, y ) = max {A × B, A × Y


Summary

•Fuzzification: It is the method of transforming a crisp quantity(set) into a fuzzy


quantity(set).

•This can be achieved by identifying the various known crisp and deterministic
quantities as completely nondeterministic and quite uncertain in nature.

•This uncertainty may have emerged because of vagueness and imprecision which then
lead the variables to be represented by a membership function as they can be fuzzy in
nature.

•For example, when I say the temperature is 45° Celsius the viewer converts the crisp
input value into a linguistic variable like favorable temperature for the human body,
hot or cold.
Self-Assessment Questions

1. Crisp logic cant be used in

(a) Ordinal data


(b) Categorical data
(c) Linguistic data

P, P =⇒ Q, ⇔ Q is

a) Modus Ponens
b) Modus Tollens
c) Chain rule
d) Generalized Modus Ponens
(GMP)
TERMINAL QUESTIONS

1. Define generalized MT and MP

2. List various proportional logics used in fuzzy inference


3. Apply the fuzzy GMP rule to deduce Rotation is quite slow

Given that : If temperature is High then rotation is Slow.

temperature is Very High


Let,

X = {30, 40, 50, 60, 70, 80, 90, 100} be the set of temperatures.

Y = {10, 20, 30, 40, 50, 60} be the set of rotations per minute.

4. Summarize various fuzzy rules used for inference


THANK
YOU

You might also like