Professional Documents
Culture Documents
105
Fuzzy Logic
( ) ( )
~ ~
1 P T P T =
( )
|
.
|
\
|
|
.
|
\
|
=
|
.
|
\
|
v
v
~
~
~
~
~ ~
~
~
, max
:
Q T P T Q P T
B or A x Q P
( )
|
.
|
\
|
|
.
|
\
|
=
|
.
|
\
|
.
.
~
~
~
~
~ ~
~
~
, min
:
Q T P T Q P T
B and A x Q P
( )
|
.
|
\
|
|
.
|
\
|
=
|
.
|
\
|
v =
|
.
|
\
|
~
~
~
~
~
~
~
~
, max Q T P T Q P T Q P T
Q P
Negation
Disjunction
Conjunction
Implication [Zadeh, 1973]
106
Fuzzy Logic
( ) ( )
( ) ( ) ( ) ( ) ( ) ( ) | | x y x y x
Y A B A R
A B A R
~ ~ ~ ~
1 , max ,
~ ~ ~ ~
. =
=
Example:
= medium uniqueness =
= medium market size =
Then
)
`
+ +
4
2 . 0
3
1
2
6 . 0
)
`
+ + +
5
3 . 0
4
8 . 0
3
1
2
4 . 0
~
A
~
B
107
Fuzzy Logic
108
Fuzzy Logic
When the logical conditional implication is of the
compound form,
IF x is , THEN y is , ELSE y is
Then fuzzy relation is:
whose membership function can be expressed as:
~
A
~
B
~
C
( ) ( )
~ ~ ~ ~ ~
C A B A R =
( ) ( ) ( ) ( ) ( ) ( ) ( )
(
|
.
|
\
|
. . = y x y x y x
C A B A R
~ ~ ~ ~ ~
1 , max ,
109
Fuzzy Logic
Rule-based format to represent fuzzy information.
Rule 1: IF x is , THEN y is , where and represent
fuzzy propositions (sets)
Now suppose we introduce a new antecedent, say, and we
consider the following rule
Rule 2: IF x is , THEN y is
~
A
~
B
~
B
~
A
'
~
A '
~
B
R A B ' '
~ ~
=
110
Fuzzy Logic
111
Fuzzy Logic
Suppose we use A in fuzzy composition, can we get
The answer is: NO
Example:
For the problem in pg 127, let
A = A
B = A R
= A R
= {0.4/1 + 0.4/2 + 1/3 + 0.8/4 + 0.4/5 + 0.4/6} B
R B B
~ ~
=
112
Fuzzy Tautologies, Contradictions,
Equivalence, and Logical Proofs
The extension of truth operations for tautologies,
contradictions, equivalence, and logical proofs is no
different for fuzzy sets; the results, however, can differ
considerably from those in classical logic. If the truth
values for the simple propositions of a fuzzy logic
compound proposition are strictly true (1) or false (0), the
results follow identically those in classical logic. However,
the use of partially true (or partially false) simple
propositions in compound propositional statements results
in new ideas termed quasi tautologies, quasi
contradictions, and quasi equivalence. Moreover, the idea
of a logical proof is altered because now a proof can be
shown only to a matter of degree. Some examples of
these will be useful.
113
Fuzzy Tautologies, Contradictions,
Equivalence, and Logical Proofs
Truth table (approximate modus ponens)
A B AB (A.(AB)) (A.(AB))B
.3 .2 .7 .3 .7
.3 .8 .8 .3 .8 Quasi tautology
.7 .2 .3 .3 .7
.7 .8 .8 .7 .8
Truth table (approximate modus ponens)
A B AB (A.(AB)) (A.(AB))B
.4 .1 .6 .4 .6
.4 .9 .9 .4 .9 Quasi tautology
.6 .1 .4 .4 .6
.6 .9 .9 .6 .9
114
Fuzzy Tautologies, Contradictions,
Equivalence, and Logical Proofs
The following form of the implication operator show
different techniques for obtaining the membership function
values of fuzzy relation defined on the Cartesian product
space X Y:
~
R
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
Fuzzy Logic
Rule-based format to represent fuzzy information.
Rule 1: IF x is , THEN y is , where and represent
fuzzy propositions (sets)
Now suppose we introduce a new antecedent, say, and we
consider the following rule
Rule 2: IF x is , THEN y is
~
A
~
B
~
B
~
A
'
~
A '
~
B
R A B ' '
~ ~
=
156
Fuzzy Logic
157
Fuzzy Logic
Suppose we use A in fuzzy composition, can we get
The answer is: NO
Example:
For the problem in pg 127, let
A = A
B = A R
= A R
= {0.4/1 + 0.4/2 + 1/3 + 0.8/4 + 0.4/5 + 0.4/6} B
R B B
~ ~
=
158
Fuzzy Tautologies, Contradictions,
Equivalence, and Logical Proofs
The extension of truth operations for tautologies,
contradictions, equivalence, and logical proofs is no
different for fuzzy sets; the results, however, can differ
considerably from those in classical logic. If the truth
values for the simple propositions of a fuzzy logic
compound proposition are strictly true (1) or false (0), the
results follow identically those in classical logic. However,
the use of partially true (or partially false) simple
propositions in compound propositional statements results
in new ideas termed quasi tautologies, quasi
contradictions, and quasi equivalence. Moreover, the idea
of a logical proof is altered because now a proof can be
shown only to a matter of degree. Some examples of
these will be useful.
159
Fuzzy Tautologies, Contradictions,
Equivalence, and Logical Proofs
Truth table (approximate modus ponens)
A B AB (A.(AB)) (A.(AB))B
.3 .2 .7 .3 .7
.3 .8 .8 .3 .8 Quasi tautology
.7 .2 .3 .3 .7
.7 .8 .8 .7 .8
Truth table (approximate modus ponens)
A B AB (A.(AB)) (A.(AB))B
.4 .1 .6 .4 .6
.4 .9 .9 .4 .9 Quasi tautology
.6 .1 .4 .4 .6
.6 .9 .9 .6 .9
160
Fuzzy Tautologies, Contradictions,
Equivalence, and Logical Proofs
The following form of the implication operator show
different techniques for obtaining the membership function
values of fuzzy relation defined on the Cartesian product
space X Y:
~
R
161
Fuzzy Tautologies, Contradictions,
Equivalence, and Logical Proofs
The following common methods are among those proposed
in the literature for the composition operation , where
is the input, or antecedent defined on the universe X, is
the output, or consequent defined on the universe Y, and
is a fuzzy relation characterizing the relationship between
specific inputs (x) and specific outputs (y):
Refer fig on next slide
~ ~ ~
R A B =
~
A
~
B
~
R
162
Fuzzy Tautologies, Contradictions,
Equivalence, and Logical Proofs
where f(.) is a logistic function (like a sigmoid or step function)
that limits the value of the function within the interval [0,1]
Commonly used in Artificial Neural Networks for mapping
between parallel layers of a multi-layer network.