Introduction

Although probability theory has been an age old tool to handle

uncertainty, but it can be applied only to situations whose
characteristics are based on random processes, that is processes in
which the occurrence of events are strictly determined by chance.
However in reality there turn out to be problems whose uncertainty is
characterized by a nonrandom process.
Here uncertainty may arise due to partial information about the
problem or information which is not reliable or due to the receipt of
information from the more than one sources.
It is in such kind of situations where fussy set theory exhibits immense
potential for effective solving of the uncertainty in the problem.

Introduction
Fuzziness means vagueness.
Fuzzy set theory is an excellent mathematical tool to handle
uncertainty arising due to vagueness.
Understanding human speech and recognizing hand written characters
are some common instances where fuzziness manifests.
it was latfi A zadeh who pronounced the fuzzy set theory in his
seminar paper. Since then many theoretical developments have taken
place in this field.








Fuzzy versus crisp
Consider the query, is water colorless? the answer to this is a definite
yes/true, or no/false, as warranted by the situation.
If yes/true is accorded a value of 1 and no/false is accorded a value of 0,
this statement results in a 0/1 type of situation.
Such a logic which demands a binary (0/1) type of handling is termed
crisp in the domain of fuzzy set theory.
On the other hand, consider the statement, is ram honest? the
answer to this query need not be a definite yes or no.
Considering the degree to which one knows ram a variety of answers
spanning a range, such as extremely honest, extremely dishonest,
honest at times, very honest could be generated.
If for instance extremely honest were to be accorded a value of 1, at
the high end of the spectrum of values, extremely dishonest a value of
0 at the low end of the spectrum, then honest at times and very
honest could be assigned values of 0.4 and 0.85 respectively.
Fuzzy versus crisp
Membership in crisp: An element x is said to be a member of a set A
if x belongs to the set A. the membership is indicated by and is
pronounced belongs to. Thus x A means x belongs to A.
So for given set A = {4,5,6,7,8,10} for x =3 and y = 4 we have x belongs to A
and y does not belong to A.
Fuzzy sets: fuzzy sets supports a flexible sense of membership of elements
to a set. While in crisp set theory, an element either belongs to or does not
belong to a set, in fuzzy set theory many degrees of membership (between
0 and 1) are allowed. Thus a membership function
A
(x) is associated
with a fuzzy set A such that the function maps every element of the
universe of discourse X (or the reference set) to the interval [0,1].
Formally the mapping is written as
A
(x) : X - > [0,1].

Fuzzy versus crisp
If X is a universe of discourse and x is a particular element of X, then a
fuzzy set A defined on X may be written as a collection of ordered pairs
A = {(x,
A
(x)), x X}
where each pair (x,
A
(x)) is called a singleton.
Basic fuzzy set operations
Union;

AUB
(x) = max(
A
(x),
B
(x))
Intersection

A B
(x) = min(
A
(x),
B
(x))
Complement

A
C
(x) = 1
A
(x)
Product of two fuzzy sets

A.B
(x) =
A
(x).
B
(x)
Product of a fuzzy set with a crisp number

a . A
(x) = a.
A
(x)
Power of a fuzzy set

Difference

Disjunctive sum

Fuzzy relations
Fuzzy relation is a fuzzy set defined on the Cartesian
product of crisp sets X
1
, X
2
,.,X
n
where the n-tuples (x
1
,
x
2
,.,x
n
) may have varying degrees of membership within
the relation. The membership values indicate the strength
of the relation between the tuples.
Example: let R be the fuzzy relation between two sets X
1

and X
2
where X
1
is the set of diseases and x
2
is the set of
symptoms.
X
1
= {typhoid, viral fever, common cold}
X
2
= {running nose, high temperature, shivering}
The fuzzy relation R may be defined as
Running nose High
temperature
Shivering
Typhoid 0.1 0.9 0.8
Viral fever 0.2 0.9 0.7
Common cold 0.9 0.4 0.6
Fuzzy Cartesian product: let A be a fuzzy set defined on
the universe X and B be a fuzzy set defined on the universe
Y, the Cartesian product between the fuzzy sets A and B
indicated as A * B and resulting in a fuzzy relation R is
given by
R = A * B on X * Y
Where R has its membership function given by

R
(x,y) =
AxB
(x,y)
= min(
A
(x),
B
(y))
Example
Let A = {(x
1
, 0.2),(x
2
,0.7),(x
3
,0.4)} and B =
{(y
1
,0.5),(y
2
,0.6)} be two fuzzy sets defined on the
universe of discourse X = {x
1
,x
2
,x
3
} and Y = {y
1
,y
2
}
respectively. Then fuzzy relation R resulting out of the
fuzzy Cartesian product
A x B is given by
R = A x B =
y
1
y
2
X
1
0.2 0.2
X
2
0.5 0.6
X
3
0.4 0.4
R(x
1
,y
1
) = min(
A
(x
1
),
B
(y
1
)) = min(0.2,0.5) = 0.2
R(x
1
,y
2
) = min(0.2,0.6) = 0.2
R(x
2
,y
1
)=min(0.7,0.5) = 0.5
R(x
2
,y
2
)=min(0.7,0.6) = 0.6
R(x
3
,y
1
) = min(0.4,0.5) = 0.4
R(x
3
,y
2
) = min(0.4,0.6) = 0.4
Operation on fuzzy relation
Let R and S be fuzzy relations on X x Y
Union:

RUS
(x,y) = max(
R
(x,y),
S
(x,y))

Intersection

R SS
(x,y) = min(
R
(x,y),
S
(x,y))

Complement
R
C
(x,y) = 1 R(x,y)
Operation on fuzzy relation
Composition of relations: The definition is similar to that of crisp
relation. Suppose R is a fuzzy relation defined on X x Y, and S is a Fuzzy
relation defined on Y x Z then R S is a fuzzy relation on X x Z. the
fuzzy max-min composition is defined as

R S
(x,z) = max(min(
R
(x,y),
S
(y,z)))


Example
X = {x
1
,x
2
,x
3
} Y = {y
1
,y
2
} Z = {z
1
,z
2
,z
3
}

Let R be a fuzzy relation




Let S be a fuzzy relation
y
1
y
2
x
1
0.5 0.1
x
2
0.2 0.9
x
3
0.8 0.6
z
1
z
2
z
3
y
1
0.6 0.4 0.7
y
2
0.5 0.8 0.9
Then R S, by max-min composition yields.


R S =





How?
With the formula which is given on the next slide
z
1
z
2
z
3
x
1
0.5 0.4 0.5
x
2
0.5 0.8 0.9
x
3
0.6 0.6 0.7

R S
(x,z) = max(min(
R
(x,y),
S
(y,z)))

Here in our example


R S
(x
1
,z
1
) = max(min(0.5,0.6),min(0.1,0.5))
= max(0.5,0.1)
= 0.5

R S
(x
1
,z
2
) = max(min(0.5,0.4),min(0.1,0.8))
=max(0.4, 0.1)
= 0.4

R S
(x
1
,z
3
) = max(min(0.5,0.7),min(0.1,0.9))
= max(0.5,0.1)
= 0.5

And so on
fzzification
Definition: the process of transforming crisp input
values into linguistic values is called fuzzification. It
has two major steps:
Input values are translated into linguistic concepts,
which are represented by fuzzy sets.
Membership functions are applied to the measurements,
and the degree of membership is determined.
Figure 5.3


Figure 5.4

A membership function maps elements of a fuzzy set
to real numbered values in the interval 0 to 1.
The curve representing the mathematical function is
nothing but a membership function that determines
the degree of belonging of a member x to the fuzzy set
T.
If x = 27
o
C, a fuzzy membership function A defines
from a set of possible temperatures to the interval [0,
1]. Mathematically it is represented as follows:
A:X -> [0, 1]
Where X is the set of all possible temperatures and
A is the fuzzy membership function
Types of fuzzy functions
Quasi-fuzzy membership functions

Figure 5.8

Types of fuzzy functions
Triangular fuzzy membership functions

Figure 5.9

Types of fuzzy functions
Trapezoidal fuzzy membership functions

Figure 5.10

Linguistic variables
The power and strength of fuzzy logic comes from its
ability to deal with vague linguistic variables.
A linguistic variable is a variable whose values are
words or sentences in a natural language.
For example, temperature is a linguistic variable if it
takes values such as hot, cool, warm and comfortable
instead of 20
0
C, 24
o
C, 30
0
C and so on
The framework of a linguistic variable is given as
(X,Lx,X, x)
Linguistic variables
X denotes the symbolic name of a linguistic variable (e.g, age, height,
speed, temperature, etc)
Lx is a set of linguistic values that X can take, such as hot, cool, warm,
and comfortable for temperature. Lx is also called a term set or
reference set of X.
X is the physical domain that defines crisp values. In the case of the
linguistic variable temperature, it can be the interval [-10, 35].
x is a fuzzy function that maps linguistic terms of the variable to the
equivalent crisp values.
Linguistic variables
X is the name of the linguistic variable that is speed.
Lx is the set of linguistic values that X can take, here it is the set {fast,
moderate, slow, vary slow}.
X is the physical domain that defines crisp values. with regard to the
linguistic variable speed, X is the interval [0, 100], with a unit of
km/hour.
x is a fuzzy function that maps linguistic terms of the variable to the
equivalent crisp values.

logic
Logic is the science of reasoning, symbolic or
mathematical logic has turned out to be a powerful
computational paradigm.
Just as mathematical sets have been classified into
crisp sets and fuzzy sets, logic can also be broadly
viewed as crisp and fuzzy logic.
Just as crisp set survive on a 2-state truth
value(true/false) and fuzzy logic on a multistate truth
value (true/false/very true/partly false and so on)
logic
Crisp logic
Fuzzy logic
Propositional logic
Predicate logic
Propositional logic
Predicate logic
Crisp logic
Consider the statements water boils at 90
0
C and sky is
blue. An agreement or disagreement with these
statements takes on a value false and second takes on a
true.
Thus a statement which is either true or false but not
both is called a proposition. A proposition is indicated
by upper case letters such as P, Q, R and so on.
E.g. P: water boils at 90
0
C.
Q: sky is blue.
Are propositions.
A simple proposition is also known as an atom.
Propositions alone are insufficient to represent
phenomena in the real world. In order to represent
complex information, one has to build a sequence of
propositions linked using connectives or operators.
Propositional logic recognizes five major operators as
shown in the next slide.
Propositional logic connectives
symbol connective usage description
^ and P^Q P and Q are true
v or P v Q Either P or Q is
true
~ not ~P P is not true
=> implication P=>Q P implies Q is
true
= equality P = Q P and Q are equal
is true

Truth table for five connectives
P Q P ^ Q P v Q ~ P P => Q P = Q
T T T T F T T
T F F T F F F
F F F F T T T
F T F T T T F
Obtain a truth table for the formula (P v Q) => ( ~P). Is
it a tautology?

P Q P v Q ~P P v Q =>
~P
T F T F F
F T T T T
T T T F F
F F F T T
NO
Show that (P => Q) = (~P v Q)

P Q A: P=> Q ~P B: ~P v Q A = B
T T T F T T
T F F F F T
F F T T T T
F T T T T T
Is ((P => Q) ^ (Q => P) = (P = Q) a tautology?
Laws of propositional logic
Commutativity : (P v Q) = (Q v P)
(P ^ Q) = (Q ^ P)
Associativity :(P v Q) v R = P v (Q v R)
(P ^ Q) ^ R = P ^ (Q ^ R)
Distributivity :(P v Q) ^ R = (P ^ R) v (Q ^ R)
(P ^ Q) v R = (P v R) ^ (Q v R)
Identity : P v false = P
P ^ true = P
Negation: P ^ ~P = false
P v ~p = true
Laws of propositional logic
Idempotence: P v P = P
P ^ P = P
Absorption : P ^ (P v Q) = P
P v (P ^ Q = P
De Morgans laws: ~(P v Q) = (~P ^ ~Q)
~(P ^ Q) = (~P v ~Q)
Involution: ~(~P) = P
Simplify (~(P ^ Q) => R) ^ P ^ Q.
Solution
(~(P ^ Q) => R) ^ P ^ Q
= (~~(P ^ Q) v R) ^ P ^ Q
(by eliminating => using (P => Q) = (~P v Q))
= ((P ^ Q) v R) ^ (P ^ Q) (by the law of involution)
= (P ^ Q) (by the law of absorption)
Inference in propositional logic
Inference is a technique by which, given a set of facts or postulates
or axioms or premises F1, F2,Fn, a goal G is to be derived. For
example from the facts where there is smoke there is fire, and
there is smoke in the hill, the statement then the hill is on fire
can be easily deduced.
In propositional logic, three rules are widely used for inferring facts,
namely
Modus ponens
Modus tollens, and
Chain rule
Modus ponens(mod pons)
Given P => Q and P to be true, Q is true.
P => Q
P
Q
Here, this formulas above the line are the premises and the below is
the goal which can be inferred from the premises.
Modus tollens
Given P => Q and ~Q to be true, ~P is true.
P => Q
~Q
~P

Chain rule
Given P => Q and Q => R to be true, P => R is true.
P => Q
Q => R
P => R
Note that the chain rule is a representation of the
transitivity relation with respect to the => connective.
Example
Given
I. C v D
II. ~H => (A ^ ~B)
III. (C v D) => ~H
IV. (A ^ ~B) => (R v S)
Can (R v S) be inferred from the above?
solution
From (i) and (iii) using the rule of modus ponens, ~H can be
inferred.
(i) C v D
(iii) (C v D) => ~H
~H (v)
From (ii) and (iv) using the chain rule, ~H => (R v S) can be
inferred.
(ii) ~H => (A ^ ~B)
(iv) (A ^ ~B) => (R v S)
~H => (R v S) (vi)

solution
From (v) and (vi) using the rule of modus ponens (R v S) can
be inferred.
(vi) ~H => (R v S)
(v) ~H
R v S
Hence, the result.
Inference example for predicate logic
Given
(i) every soldier is strong-willed.
(ii) All who are strong willed and sincere will succeed in
their career.
(iii) Indira is a soldier.
(iv) Indira is sincere.
prove: will indira succeed in her career?

First conversion into predicate logic
x (soldier(x) => strong-willed(x))
x ((strong-willed(x) ^ sincere(x)) => succeed_career(x))
Soldier(indira)
Sincere(indira)
to show whether indira will succeed in her career, we need to
show succeed_career(indira) is true (v).

Since (i) and (ii) are quantified by the universal quantifiers, they
should be true for indira as well.
Substituting x = indira in (i) results in
(soldier(indira) => strong-willed(indira)) that means
~soldier(indira) v strong-willed(indira) (vi)
Since from (iii) soldier is true, (vi) simplifies to
strong-willed(indira) (vii)
Substituting x = indira in (ii),
(strong-willed(indira) ^ sincere(indira) => succeed_career(indira)
~ (strong-willed(indira) ^ sincere(indira) v succeed_career(indira) or
~ (strong-willed(indira) v ~ sincere(indira) v succeed_career(indira) (viii)
from (vii), strong-willed(indira) is true and from (iv) sincere(indira) is
true. Substituting these in (viii)
False v False v succeed_career(indira)
Succeed_career(indira)
So here indira will succeed in her career is true.
=> From set perspective
It is useful to view the => operator from a set oriented perspective. If X
is the universe of discourse and A, B are sets defined in X, then
propositions P and Q could be defined based on an element x which
belongs to X to A or B.
Here P, Q are true if x belongs to A and x belongs to B ~P, ~Q are true if
x does not belong to A and x does not belong to B respectively.
If the => connective deals with two different universes of discourse that
is A set is on X universe and B set is on Y universe then the =>
connective is represented by the relation R such that
R = (A x B) U (A x Y)
In such a case p=> Q is linguistically referred to as IF A THEN B. the
compound proposition (P => Q) v (~P => S) linguistically referred to as
IF A THEN B (P => Q)
IF ~A THEN C (~P => S)
Where P, Q, and S are defined by sets A, B, C.
A is on universe X and B, C on universe Y.

Fuzzy logic
In crisp logic the truth values acquired by propositions
or predicates are 2-values namely true or false which
may be treated numerically equivalent to (0,1)
Fuzzy propositions
A fuzzy propositions is a statement that derives a fuzzy truth value. The
truth value of the proposition can be given as T(p), which lies between
[0,1]. For example, if p: Mr. Bond is honest, then T(p) = 0.9
Example
P: ram is honest
T(p) = 0.8 if P is partly true.
T(p) = 1 if P is absolutely true.

Fuzzy connectives.

symbol connective usage definition
~ negation ~P 1 T(p)
V disjunction P V Q Max(T(p),T(Q))
^ conjunction P^Q Min(T(p),T(p))
=> implication P=> Q Max(1-T(P),T(Q))
Example
P : Mary is efficient, T(P) = 0.8
Q: Ram is efficient, T(Q) = 0.65
i. P : mary is not efficient.
T(P) = 1 T(P) = 1 -0.8 = 0.2
ii. P ^ Q: Mary is efficient and so is ram.
T(P ^ Q) = min(T(P), T(Q))
= min(0.8,0.65)
= 0.65
iii. P v Q: either mary or ram is efficient.
T(P v Q) =max(T(P), T(Q))
=max(0.8,0.65)
=0.8
iv. P=>Q: if mary is efficient then so is ram.
T(P=>Q) = max(1 T(P), T(Q))
= max(0.2,0.65)
= 0.65
=> Operator from set perspective
P and Q related by the => operator are known as antecedent and
consequent respectively. Also, just as in crisp logic, here too =>
represents the IF-THEN statement as
IF x is A THEN y is B, and 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))

Also for the compound implication IF x is A then y is B else y is C the
relation R is equivalent to
R = (A x B) U (AxC)
The membership function of R is given by

R
(x,y) = max(min(
A
(x),
B
(y)),min(1
A
(x),
C
(y))
Example
Let X = {a, b, c, d} Y = {1, 2, 3, 4}
And A = {(a,0) (b,0.8) (c, 0.6) (d, 1)}
B = {(1, 0.2) (2, 1) (3, 08) (4, 0)}
C = {(1, 0) (2, 0.4) (3, 1) (4,0.8)}
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 (i) compute
R = (A x B) U (A x Y) where

R
(x, y) = max(min(
A
(x),
B
(y)), 1
A
(x))

A x B =
1 2 3 4
a 0 0 0 0
b 0.2 0.8 0.8 0
c 0.2 0.6 0.6 0
d 0.2 1 0.8 0
A x Y =




R =
1 2 3 4
a 1 1 1 1
b 0.2 0.2 0.2 0.2
c 0.4 0.4 0.4 0.4
d 0 0 0 0
1 2 3 4
a 1 1 1 1
b 0.2 0.8 0.8 0.2
c 0.4 0.6 0.6 0.4
d 0.2 1 0.8 0
To determine (ii) compute
R = (A x B) U (A x C) where
R(x,y) = max(min(A(x), B(y)), min(1 A(x), C(y)))

A x B =
1 2 3 4
a 0 0 0 0
b 0.2 0.8 0.8 0
c 0.2 0.6 0.6 0
d 0.2 1 0.8 0
A x C =




R =
1 2 3 4
a 0 .4 1 0.8
b 0 0.2 0.2 0.2
c 0 0.4 0.4 0.4
d 0 0 0 0
1 2 3 4
a 0 0.4 1 0.8
b 0.2 0.8 0.8 0.2
c 0.2 0.6 0.6 0.4
d 0.2 1 0.8 0
Fuzzy control system
A fuzzy control system is based on fuzzy logic. Given
membership functions that map crisp values to fuzzy
values and vice versa, the machine can interact with the
human being in friendlier way.
Fuzzy logic systems address the imperfection of the input
and output variables by defining fuzzy members and fuzzy
sets, which can be expressed in linguistic variables( e.g.,
high, low, and average).
Fuzzy controllers are the most important applications of
fuzzy theory. They work rather differently from
conventional controllers because the experts knowledge is
used for more effective and human like control instead of a
pure, crisp, mathematical approach to describe a system.
Fuzzy control system
This knowledge can be expressed in a natural way using
linguistic variables, which are described by fuzzy sets.
Fuzzy logic based control systems are also useful for some o
the control applications where a systematic mathematical
model does not exists.
Instead of describing control strategy as mathematical
equations, control is expressed as a set of linguistic rules.
A control system can be abstracted as a box with inputs
flowing into it and outputs emerging from it. The process
of designing a fuzzy control system can be described using
following steps:

Fuzzy control system
Step 1: identify principle inputs, outputs, and process task.
Step 2: identify linguistic variables used, and define fussy
sets and membership accordingly.
Step 3: use these fuzzy sets and linguistic variables to form
procedural rules.
Step 4: Determine the defuzzification method.
Step 5: test the system and modify accordingly.
The components of a typical control system are shown in
figure.



Fuzzy control system

Fuzzy control system
A fuzzy controller consists of four main components:
1. fuzzy knowledge base: the knowledge base consists
of fuzzy rules for the system that represent the
knowledge and experience of a human expert. For
example if temperature is fairly high and the
pressure is very low, then the output is medium.
Fuzzy control system
2. fuzzifier: the fuzzyfier receives the actual output of
the system and transforms the nonfuzzy values into
membership degrees based on the corresponding
fuzzy sets.
3.Action interface: this interface defuzzifies the
outcome of the inference engine to produce a
nonfuzzy value, which represents the actual control
function to be applied to the system.

Fuzzy control system
4. inference engine: it performs inferencing upon
fuzzified inputs to produce a fuzzy output.
Limitations of fussy systems
Fuzzy systems lack the capabilities of machine learning, as
well as a neural network type memory and pattern
recognition. Therefore, hybrid systems (e.g. neurofuzzy
systems) are becoming more popular for specific
appicaions.
Verification and validation of a fuzzy knowledge based
system typically requires extensive testing with hardware in
the loop. This is an expensive affair.
Determining exact fuzzy rules and membership functions
is a hard task. One can not predict how may membership
functions required even after wide testing.
Stability is an important concern for fuzzy control.
Fuzzy rule based system
A fuzzy rule based system(FRBS) is a application of fuzzy
logic to rule based system.
Generally two models are available.
The mamdani model
Takagi sugeno kang model
The basic structure of the mamdani and takagi-sugeno-
kang(TSK) models are presented in next slide.
Fuzzy rule based system
Fuzzy rule based system
The TSK model calculates the output with a simple formula
(weighted average).
The mamdani fuzzy model requires the values to be
fuzzified and defuzzified, which maks this model bit more
complicated.
One of the basic differences between the mamdani and
TSK fuzzy models is the fact that the results are,
respectively, fuzzy and crisp sets.
Hence the procedures involved in the computation of the
output signals are distinct.
defuzzification
Defuzzyfication : defuzzification converts the fuzzy value
into a crisp value. It is the process of producing a
quantifiable result from the fuzzy linguistic variable used.
So this conversion of a fuzzy set to single crisp value is
called defuzzification and is the reverse process of
fuzzification. The example methods of defuzzification are :
Max-membership method: this method chooses the element with
the maximum value.
Centroid method: the centroid defuzzification method finds the
center point of the targeted fuzzy region by calculating the
weighted mean of the output fuzzy region.
Weighted average method: the weighted average method assigns
weights to each membership function in the output by its respective
maximum membership value.
Fuzzy inference
Fuzzy inference
Fuzzy inference also referred to as approximate reasoning
refers to computational procedures used for evaluating
linguistic descriptions. The two important inferring
procedures are
Generalized Modus ponens(GMP)
Generalized Modus tollens(GMT)
GMP is formally stated as
IF x is A(fuzzy set), THEN y is B(fuzzy set)
x is A


y is B
Here A, B, A, B are fuzzy terms. Every fuzzy linguistic
statement above the line is analytically known and
what is below is analytically unknown.
To compute the membership function of B, the max-
min composition of fuzzy set A with R(x, y) which is
the known implication relation(IF-THEN relation) is
used. That is
B = A R(x,y)
In terms of membership function,

B
(y) = max(min(
A
(x),
R
(x,y)))


On the other hand GMT has the form
IF x is A(fuzzy set) THEN y is B(fuzzy set)
y is B


The membership of A is computed on similar lines as
A = B R(x,y)
In terms of membership function,

A
(x) = max(min(
B
(y),
R
(x,y)))
X is A
Example
Apply the fuzzy modus ponens rule to deduce rotation is quite slow
given
If the temperature is high then the rotation is slow.
The temperature is very high.
let H (high), VH(very high), S(slow) and QS(quite slow) indicate the
associated fuzzy sets as follows:
For X = {30, 40, 50, 60, 70, 80, 90, 100}, the set of temperatures and Y
= {10, 20, 30, 40, 50, 60}, the set of rotations per minute.
H = {(70, 1) (80, 1) (90,0.3)}
VH = {(90, 0.9) (100, 1)}
QS = {(10, 1) (20, 0.8)}
S = {(30, 0.8) (40, 1) (50, 0.6)}
To derive R(x,y) representing the implication relation(i), we need to
compute

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



H x S =

10 20 30 40 50 60
30 0 0 0 0 0 0
40 0 0 0 0 0 0
50 0 0 0 0 0 0
60 0 0 0 0 0 0
70 0 0 0.8 1 0.6 0
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




H x Y =
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
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



R(x,y) =
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
70 0 0 0.8 1 0.6 0
80 0 0 0.8 1 0.6 0
90 0.7 0.7 0.7 0.7 0.7 0.7
100 1 1 1 1 1 1
To deduce rotation is quite slow we make use of the
composition rule
QS = VH R(x,y)

= [0 0 0 0 0 0 0.9 1] *
1 1 1 1 1 1
1 1 1 1 1 1
1 1 1 1 1 1
1 1 1 1 1 1
0 0 0.8 1 0.6 0
0 0 0.8 1 0.6 0
0.7 0.7 0.7 0.7 0.7 0.7
1 1 1 1 1 1
= [1 1 1 1 1 1]