DREAM

IDEA
PLAN
IMPLEMENTATION
1

Fuzzy Sets and Fuzzy Logic

Present to:
Amirkabir University of Technology (Tehran
Polytechnic) & Semnan University

Dr. Kourosh Kiani

Email: kkiani2004@yahoo.com
Email: Kourosh.kiani@aut.ac.ir
Web: www.kouroshkiani.com

Lecture 04

Extension Principle

Extension Principle

Fuzzy Numbers
A fuzzy number is fuzzy subset of the universe of a
numerical number.
A fuzzy real number is a fuzzy subset of the domain
of real numbers.
A fuzzy integer number is a fuzzy subset of the
domain of integers.

Fuzzy Numbers: Example

Functions with Fuzzy Arguments

A crisp function maps its crisp input argument to its
image.
Fuzzy arguments have membership degrees.
When computing a fuzzy mapping it is necessary to
compute the image and its membership value.

Crisp Mappings

Functions applied to intervals

Functions applied to intervals
Compute the image of the interval.
An interval is a crisp set.

Fuzzy Mappings

10

Extension Principle

11

Extension Principle

12

Monotonic Continuous Functions

For each point in the interval
Compute the image of the interval.
The membership degrees are carried through.

13

Monotonic Continuous Functions

14

Monotonic Continuous Functions

15

Functions Applied to Crisp

Sets
y

y = f(x)
B

B(y)

A(x)

f
(
A
)
x
x

16

Functions Applied to Fuzzy

Sets
y

y = f(x)

B
B(y)

B f ( A)
x

A(x)

A
x
17

Functions Applied to Fuzzy

Sets
y

y = f(x)

B
B(y)

B f ( A)
x

A(x)

A
x
18

Assume a fuzzy set A and a function f.

How does the fuzzy set f(A) look like?

The Extension Principle

y

B ( y ) f ( A) ( y )

y = f(x)

max
A ( x)
1
x f

B(y)

A(x)

( y)

sup A ( x)
x f 1 ( y )

A
x

19

Monotonic Continuous Extension

20

NonMonotonic Continuous Functions

For each point in the interval:
Compute the image of the interval.
The membership degrees are carried through.
When different inputs map to the same value,
combine the membership degrees.
21

NonMonotonic Continuous Functions

22

NonMonotonic Continuous Extension

23

NonMonotonic Continuous Extension

24

Extension Principle

B ( y)

max

y f ( x1 , x2 ,.... xn )

{min[ A1 ( x1 ), A2 ( x2 ),...., An ( xn )]}

If the function f is a continuous-valued expression, the max operator is replaced

By the sup (supermum) operator (the least upper bound)
25

Arithmetic Operations
Applying the extension principle to arithmetic
operations it is possible to define fuzzy
arithmetic operations
Let x and y be the operands, z the result.
Let A and B denote the fuzzy sets that represent
the operands x and y respectively.
26

Fuzzy Addition

27

Fuzzy Addition Examples

28

Fuzzy Addition Examples

29

Fuzzy Addition Examples

30

Fuzzy Addition Examples

31

Fuzzy Production Examples

0.6 1 0.8
A 2 " Approximat ely 2 {

}
~
1 2 3
0.8 1 0.7
B 6 " Approximat ely 6 {

}
~
5 6 7
0 .6 1 0 .8
0 .8 1 0 .7

)(

)
1 2 3
5 6 7
min(0.6,0.8) min(0.6,1)
min(0.8,1) min(0.8,0.7)
{

...

}
5
6
18
21
0.6 0.6 0.6 0.8 1 0.7 0.8 0.8 0.7
{

}
5
6
7
10 12 14 15 18 21

A B 12 " Approximat ely 12 (

~

32

Fuzzy Production Examples

0.2 1 0.7
A {

}
1 2 4

0.5 1
B {
}
1 2

If the mapping is not one-to-one, we get:

AB ( x1 , x2 ) max {min[ A ( x1 ), B ( x2 )]}
y f ( x1 , x2 )

0.2 1 0.7
0.5 1

)(
)
1 2 3
1 2
min(0.2,0.5) max[min(0.2,1), min(0.5,1)]
{

1
2
max[min(0.7,0.5), min(1,1)] min(0.7,1)

}
4
8
0.2 0.5 1 0.7
{

}
33
1
2 4 8

f ( A, B ) A B (arithmetic product ) (

Arithmetic operations on intervals

[a, b] [d , e] [a b, b e]
[a, b] [d , e] [a e, b d ]
[a, b] [d , e] [min(a.d , a.e, b.d , b.e), max(a.d , a.e, b.d , b.e)]
[ a, b]
a a b b
a a b b
[min( , , , ), max( , , , )]
[ d , e]
d e d e
d e d e
[a, b]
[ a, b]
[b, a ]

for 0
for 0
34

Examples
[a, b]
[ a, b]
[b, a]

for 0
for 0

[a, b] [d , e] [a e, b d ]

3.[1,2] [6. 3]

[0,1] [0,1] [1,1]

[a, b] [d , e] [min(a.d , a.e, b.d , b.e), max(a.d , a.e, b.d , b.e)]

[1,3].[2,4] [min(2,4,6,12), max(2,4,6,12)] [2,12]

[ a, b]
a a b b
a a b b
[min( , , , ), max( , , , )]
[ d , e]
d e d e
d e d e

[1,2]
1
1
[1,2].[ ,1] [ ,2]
[1,2]
2
2

35

Arithmetic operations on intervals

Interval arithmetic follows properties of associativity and
commutativity for both summation and products, but it does not
follow the property of distributivity. Rather, intervals do follow a
special subclass of distrbutivity known as subdistributivity, i.e., for
three intervals, I, J, and K.

I .( J K ) I .J I .K

36

Examples
I .( J K ) I .J I .K
For I=[1, 2]

J=[2, 3]

K=[1, 4]

I .( J K ) [1,2].([2,3] [1,4]) [1,2].[2,2] [4,4]

I .J I .K [1,2].[2,3] [1,2].[1,4] [2,6] [1,8] [6,5]
Now, [4,4] [6,5], but [4,4] [6,5]

37

Approximate Methods of Extension

Vertex Method: This method greatly simplifies manipulations of the
extension principle for continuous-valued fuzzy variable, such as
fuzzy members defined on the real lines.
The algorithm works as follow:
Any continuous membership function can be represented by a
continuous sweep of -cut intervals from =0+ to =1.
Suppose B=f (A), and f is continuous
and monotonic on I=[a, b], the
interval representing B at particular
value of , say B can be defined
obtained by:

B f ( I ) [min( f (a ), f (b)), max( f (a ), f (b))]

b
38

Approximate Methods of Extension

Vertex Method
When the mapping is given by n inputs i.e., y = f(x1, x2,., xn), then
the input space can be represented by an-dimensional Cartesian
region.
Each of the input variables can be described by an interval, say Ii ,
at a specific -cut, where
Ii=[ ai , bi ] i =1,2,., n
The number of vertices, N, is a quantity equal to N = 2n , where n is
the number of fuzzy input variables.
When the mapping y = f(x1, x2,., xn) is continuous and also there
is no extreme point, the value of the interval function for a
particular -cut can be obtained by:

B f ( I1 , I 2 , I 3 ,......I n ) [min ( f (c j )), max( f (c j ))]

j

Where cj is the coordinate of the jth vertex

j 1,2,.....N
39

Approximate Methods of Extension

Vertex Method
The vertex method is accurate only when the conditions of
continuity and no extreme point are satisfied. If the extreme points
can be identified, they are simply treated as additional vertices, E k
in the Cartesian space and B can be obtained by:
B [min ( f (c j ), f ( Ek )), max( f (c j ), f ( Ek ))]
j

j 1,2,.....N k 1,2..m

For m extreme point in the region.

40

Vertex Method: Example

y
1

f(x) = x(2-x)

0.75

0.5

0.5 0.75

1.5

x
0 0. 5 1
2
We shall solve this problem using the fuzzy vertex method at
three -cut levels, for = 0+, 0.5, 1.

I 0 [0.5, 2]

I 0.5 [0.75, 1.5]

I1 [1, 1]

There are N=21=2 vertices, In addition, an extreme point does exist:

df ( x)
2 2 x 0, E1 1 ( Ek , k 1)
dx

41

Vertex Method: Example

I 0 [0.5, 2]

c1 0.5,

c2 2,

f (c1 ) 0.5(2 0.5) 0.75,

E1 1

f (c2 ) 2(2 2) 0,

f ( E1 ) 1(2 1) 1
B0 [min(0.75,0,1), max(0.75,0,1)] [0,1]
I 0.5 [0.75,1.5]

c1 0.75,

f (c1 ) 0.75(2 0.75) 0.9375,

c2 1.5,

E1 1

f (c2 ) 1.5(2 1.5) 0.75,

f ( E1 ) 1(2 1) 1
B0.5 [min(0.9375, 0.75,1), max(0.9375, 0.75,1)] [0.75,1]
42

Vertex Method: Example

I1 [1,1] c1 1,

c2 1,

E1 1

f (c1 ) f (c2 ) f ( E1 ) 1(2 1) 1,

f ( E1 ) 1(2 1) 1
B1 [min(1, 1,1), max(1, 1,1)] [1,1] 1

B0 [0,1]
B0.5 [0.75,1]
B1 1

1
B
0.5

0.5

0.75

x
43

Approximate Methods of Extension

DSW Method
The DSW algorithm also makes use of the -cut representation of
fuzzy sets but, unlike the vertex method, it use the full -cut
intervals in a standard interval analysis. The DSW algorithm
consists of the following steps:
1. Select a value where 0 1.
2. Find the interval(s) in the input membership function(s) that
correspond to this .
3. Using standard binary interval operation, compute the interval for
output membership function for selected -cut level.
4. Repeat step 1-3 for different values of to complete a -cut
representation of the solution.
44

DSW Method: Example

y

f(x) = 2x+x2

0.5

0
0

0.5 0.75

1.5

We shall solve this problem at three -cut levels, for = 0+,

0.5, 1.

I 0 [0.5, 2]

I 0.5 [0.75, 1.5]

I1 [1, 1]

There are N=21=2 vertices,

45

DSW Method: Example

I 0 [0.5, 2]

B0 2[0.5, 2] [0.52 ,2 2 ] [1, 4] [0.25, 4] [1.25, 8]

I 0.5 [0.75,1.5]
B0.5 2[0.75, 1.5] [0.752 ,1.52 ] [1.5, 3] [0.5625, 2.25] [2.0625, 5.25]

I1 [1, 1]

B1 2[1,1] [12 ,12 ] [2, 2] [1,1] [3, 3] 3

1
0.5

x
46

DSW Method: Example

y

f(x) = 2x+x2

-0.5

We shall solve this problem at three -cut levels, for = 0+,

0.5, 1.

I 0 [0.5,1] I 0.5 [0.25, 0.5] I1 [0, 0]

There are N=21=2 vertices,
47

DSW Method: Example

If the lower bound of an interval is negative and the upper
bound is positive (i.e., if the interval contains zero) and if
the function involves a square or an even-power operation,
then the lower bound of the result should be zero.
I 0 [0.5,1]

B0 2[0.5,1] [0,12 ] [1, 2] [0,1] [1, 3]

I 0.5 [0.25, 0.5]

B0.5 2[0.25, 0.5] [0, 0.52 ] [0.5,1] [0, 0.25] [0.5,1.25]

I1 [0, 0]

B1 2[0, 0] [0 2 ,0 2 ] [0, 0] [0, 0] [0, 0] 0

48

DSW Method: Example

B0 [1, 3]
B0.5 [0.5,1.25]

B1 0

1
0.5

-1

-0.5

1.25

x
3
49

Questions? Discussion?
Suggestions ?

51