L thuyt tp m v logic m

L thuyt tp m v logic m
Bi:
unknown

Tng quan v l thuyt tp m & logic m

Mc tiu

Hc xong chng ny, sinh vin phi nm bt c cc vn sau:

- Th no l khi nim ca tp m, mnh m, suy din m.

- Cc php ton trn tp m v logic m.

Kin thc c bn cn thit

Cc kin thc c bn trong chng ny bao gm:

- Nm vng cc php ton logic trong chng 1.

- Cc suy lun chng 2.

Ti liu tham kho

Nguyn Hong Cng, Bi Cng Cng, Nguyn Don Phc, Phan Xun Minh, Chu
Vn H, H m v ng dng. Nh xut bn Khoa hc v K thut, H Ni - 1998.

Ni dung ct li

- Gii thiu khi nim v tp m, cc php ton trn tp m.

- Mnh m v cc php ton logic m.

- Suy din m.

1/14
L thuyt tp m v logic m

Gii thiu

Nh bit, trong nhng suy lun i thng cng nh cc suy lun khoa hc, logic
ton hc ng mt vai tr rt quan trng.

Ngy nay, x hi cng pht trin th nhu cu con ngi ngy cng cao. Do , s tin
b ca khoa hc cng rt cao. Suy lun logic mnh gii thiu trong chng 1 (tm
gi l logic nguyn thy hay logic r) vi hai gi tr ng, sai hay 1, 0 khng gii
quyt c ht cc bi ton phc tp ny sinh trong thc t.

V d: qun o nh th no c gi l dy, l mng my git bit c m c ch

t ng sy kh cho hp l ?

Hay trong th vn c cu:

" Trng kia bao tui trng gi?

Ni kia bao tui gi l ni non? "

Khi nim trng gi hay ni non l khng c nh ngha r rng. Nhng bi ton nh
vy ngy mt nhiu hn trong cc lnh vc iu khin ti u, nhn dng h thng,... ni
chung l trong cc qu trnh quyt nh nhm gii cc bi ton vi cc d liu khng
y , hoc khng c nh ngha mt cch r rng (trong iu kin thiu thng tin
chng hn).

Mt cch tip cn mi mang li nhiu kt qu thc tin v ang tip tc pht trin
l cch tip cn ca l thuyt tp m (FUZZY SET THEORY), do gio s Lotfi Zadeh
ca trng i hc California - M ra nm 1965. Cng trnh ny thc s khai sinh
mt ngnh khoa hc mi l l thuyt tp m v nhanh chng c cc nh nghin
cu cng ngh mi chp nhn tng. Mt s kt qu bc u v hng nghin cu
tip theo gp phn to nn nhng sn phm cng nghip ang c tiu th trn th
trng. L thuyt tp m ngy cng phong ph v hon chnh, to nn vng chc
pht trin logic m. C th ni logic m (Fuzzy logic) l nn tng xy dng cc
h m thc tin, v d trong cng nghip sn xut xi mng, sn xut in nng, cc h
chuyn gia trong y hc gip chun on v iu tr bnh, cc h chuyn gia trong x
l ting ni, nhn dng hnh nh,...Cng c ch cht ca logic m l tin ha v lp
lun xp x vi php suy din m.

Trong chng ny, mc ch chnh l gii thiu khi nim tp m, logic m, tp trung
i vo cc php ton c bn v bc u i vo lp lun xp x vi php suy din m.

2/14
L thuyt tp m v logic m

Khi nim tp m (fuzzy set)

Nh chng ta bit, tp hp thng l kt hp ca mt s phn t c cng mt s tnh

cht chung no . V d : tp cc sinh vin. Ta c :

T = { t / t l sinh vin }

Vy, nu mt ngi no l sinh vin th thuc tp T, ngc li l khng thuc tp

T. Tuy nhin, trong thc t cuc sng cng nh trong khoa hc k thut c nhiu khi
nim khng c nh ngha mt cch r rng. V d, khi ni v mt "nhm sinh vin
kh", th th no l kh ? Khi nim v kh khng r rng v c th sinh vin c im
thi trung bnh bng 8.4 l kh, cng c th im thi trung bnh bng 6.6 cng l kh (
di im kh c th t 6.5 n 8.5),... Ni cch khc, "nhm sinh vin kh" khng c
nh ngha mt cch tch bch r rng nh khi nim thng thng v tp hp. Hoc,
khi chng ta ni n mt "lp cc s ln hn 10" hoc " mt ng qun o c",..., l
chng ta ni n nhng khi nim m, hay nhng khi nim khng c nh ngha
mt cch r rng. Cc phn t ca nhm trn khng c mt tiu chun r rng v tnh
"thuc v" ( thuc v mt tp hp no ). y chnh l nhng khi nim thuc v tp
m. Trong i thoi hng ngy chng ta bt gp rt nhiu khi nim m ny. V d, mt
ng gim c ni: " Nm qua chng ta gt hi c mt s thnh tch ng khen
ngi. Nm ti y chng ta phi c gng thm mt bc na". y l mt cu cha rt
nhiu khi nim m.

Nh vy, logic r c th biu din bng mt th nh sau

Logic m cng c th biu din bng mt th nhng l th lin tc

nh ngha tp m (Fuzzy set):

Cho l khng gian nn, mt tp m A trn ? tng ng vi mt nh x t ? n on

[0,1].

A : ,1] c gi l hm thuc v (membership function)

K hiu A = {(a, A(a)) / a }

Trong , A(a) [0,1] ch mc thuc v (membership degree) ca phn t a vo

tp m A.

Khong xc nh ca hm A(a) l on [0, 1], trong gi tr 0 ch mc khng thuc

v, cn gi tr 1 ch mc thuc v hon ton.

V d 1: Mt s biu din tp m cho s "integer nh".

3/14
L thuyt tp m v logic m

int

V d 2: Mt s biu din tp m cho cc tp ngi n ng thp, trung bnh v cao.

chiu cao

V d 3: Cho = {1, 2, 3, 4, 5}, tp m A trn ? tng ng vi nh x A nh sau:

A : 1 0

21

3 0.5

4 0.3

5 0.2

Ta c tp m A = {(1,0), (2,1), (3,0.5), (4,0.3), (5,0.2)}

Cch vit trn l s lit k cc phn t khc nhau cng vi mc thuc v tp hp A.

T nh ngha trn chng ta c th suy ra:

- Tp m A l rng nu v ch nu hm thuc v A(a)= 0 ,a

- Tp m A l ton phn nu v ch nu A(a) = 1 ,a

4/14
L thuyt tp m v logic m

- Hai tp m A v B bng nhau nu A(x) = B(x) vi mi x trong .

V d 4: Cho = {1, 2, 3, 4, 5}, tp m A trn tng ng vi nh x A nh v du

trn.

A = {(1,0), (2,1), (3,0.5), (4,0.3), (5,0.2)}

Tp m B trn ? tng ng vi nh x B nh sau:

B : 1 0

21

3 0.5

4 0.3

5 0.2

Ta c tp m B = {(1,0), (2,1), (3,0.5), (4,0.3), (5,0.2)}

Nhn thy, A(x) = B(x) vi mi x trong . Vy A= B.

Cc php ton v tp m

c th tin hnh m hnh ha cc h thng c cha tp m v biu din cc qui lut

vn hnh ca h thng ny, trc tin chng ta cn ti vic suy rng cc php ton logic
c bn vi cc mnh c chn tr trn on [0, 1].

Cho = {P1, P2, ...} vi P1, P2, ... l cc mnh . Tp m A trn tng ng vi
nh x v nh sau:

v : [0, 1]

Pi v(Pi)

Ta gi v(Pi) l chn tr ca mnh Pi trn [0, 1].

Php b

Php ph nh trong logic kinh in l mt trong nhng php ton c bn cho vic xy
dng php b ca 2 tp hp. suy rng php ny trong tp m chng ta cn ti ton
t v(NOT P). Ton t ny phi tha cc tnh cht sau :

5/14
L thuyt tp m v logic m

- v(NOT P) ch ph thuc vo v(P).

- Nu v(P)=1 th v(NOT P)=0

- Nu v(P)=0 th v(NOT P)=1

- Nu v(P1) v(P2) th v(NOT P1) v(NOT P2)

nh ngha 1 :

Hm n : [0,1] [0, 1] khng tng tha mn cc iu kin n(0) = 1, n(1) = 0, c gi

l hm ph nh.

V d : n(x) = 1 - x hay n(x) = 1 - x2 l cc hm ph nh.

Ta c nhn xt :

- Nu v(P1) < v(P2) th v(NOT P1) > v(NOT P2)

- v(NOT P) ph thuc lin tc vo v(P)

- v(NOT (NOT P)) = v(P)

nh ngha 2 (Phn b ca mt tp m):

Cho n l hm ph nh, phn b Ac ca tp m A l mt tp m vi hm thuc v c

xc nh bi :

AC(a) = n(A(a)) , vi mi a .

th ca hm thuc v c dng sau:

xAxxxAcC Hnh a Hnh b

Hnh a : Hm thuc v ca tp m A

Hnh b : Hm thuc v ca tp m Ac

V d : vi n(x) = 1 - x th ta c :

AC(a) = n(A(a)) = 1-A(a) , vi mi a ?.

Cho = {1, 2, 3, 4, 5}, v A l tp m trong nh sau:

6/14
L thuyt tp m v logic m

A = {(1,0), (2,1), (3,0.5), (4,0.3), (5,0.2)}

Ta c :

Ac = {(1,1), (2,0), (3,0.5), (4,0.7), (5,0.8)}

nh ngha 3:

a. Hm ph nh n l nghim ngt (strict) nu n l hm lin tc v gim nghim ngt.

b. Hm ph nh n l mnh (strong) nu n l cht v tha n(n(x)) = x , x[0, 1].

nh ngha 4:

Hm = [a,b] [a,b] gi l mt t ng cu (automorphism) ca on [a,b] nu n l

hm lin tc, tng nghim ngt v (a) = a, (b) = b.

nh l 1:

Hm n:[0,1] [0,1] l hm ph nh mnh khi v ch khi c mt t ng cu ca

on [0,1] sao cho N(x) = N(x) = -1(1 - (x)).

nh l 2 :

Hm n: [0,1] [0,1] l hm ph nh nghim ngt khi v ch khi c hai php t ng

cu , ca [0,1] sao cho n(x) = (1- (x)).

Php giao

Php hi AND trong logic kinh in l c s nh ngha php giao ca 2 tp m.

AND tho cc tnh cht sau :

- v(P1 AND P2) ch ph thuc vo v(P1), v(P2).

- Nu v(P1)=1 th v(P1 AND P2) = v(P2) , vi mi P2

- Giao hon v(P1 AND P2) = v(P2 AND P1)

- Nu v(P1) v(P2) th v(P1 AND P3) v(P2 AND P3), vi mi P3

- Kt hp v(P1 AND (P2 AND P3 )) = v((P1 AND P2 )AND P3 )

7/14
L thuyt tp m v logic m

nh ngha 5:

Hm T : [0,1]2 [0,1] l php hi (t-chun) khi v ch khi tha cc iu kin sau:

- T(1, x) = x, vi mi 0 x 1.

- T c tnh giao hon, ngha l : T(x,y) = T(y,x), vi mi 0 x,y 1.

- T khng gim theo ngha : T(x,y) T(u,v), vi mi x u, y v.

- T c tnh kt hp : T(x,T(y,z)) = T(T(x,y),x), vi mi 0 x,y,z 1.

T cc tnh cht trn c th suy ra T(0,x) = 0.

V d :

T(x,y) = min(x,y)

T(x,y) = max(0,x+y-1)

T(x,y) = x.y (tch i s ca x v y)

nh ngha 6:

Cho hai tp m A, B trn cng khng gian nn vi hm thuc v A(a), B(a), cho
T l mt php hi .

ng vi php hi T, tp giao ca hai tp m A, B l mt tp m trn vi hm thuc

v cho bi :

AB(a) = T(A(a), B(a)) a

Vi T(x,y)=min(x,y) ta c :

AB(a) = min(A(a), B(a))

Vi T(x,y) = x.y ta c:

AB(a) = A(a).B(a) (tch i s)

Ta c th biu din php giao ca hai tp m qua hai hm T(x,y)=min(x,y) v T(x,y) =

x.y theo cc th sau y:

- Hnh a : Hm thuc v ca hai tp m A v B

8/14
L thuyt tp m v logic m

- Hnh b: Giao ca hai tp m theo T(x,y) = min(x,y)

- Hnh c: Giao ca hai tp m theo T(x,y) = x.y

x x x A (x) B (x) A (x) B (x) A (x) B (x)

Hnh a Hnh b Hnh c

V d : Cho = {1, 2, 3, 4, 5}, v A, B l cc tp m trong ? nh sau:

A = {(1,0), (2,1), (3,0.5), (4,0.3), (5,0.2)}

B = {(1,0), (2,0.5), (3,0.7), (4,0.2), (5,0.4)}

Vi T(x,y) = min(x,y), ta c :

AB = {(1,0), (2,0.5), (3,0.5), (4,0.2), (5,0.2)}

AAc = {(1,0), (2,0.1), (3,0.5), (4,0.3), (5,0.2)}

Php hp

Php tuyn OR trong logic kinh in l c s nh ngha php hp ca 2 tp m. OR

tho cc tnh cht sau :

- v(P1 OR P2) ch ph thuc vo v(P1), v(P2).

- Nu v(P1) = 0 th v(P1 OR P2) = v(P2) , vi mi P2

- Giao hon v(P1 OR P2) = v(P2 OR P1)

- Nu v(P1) v(P2) th v(P1 OR P3) v(P2 OR P3), vi mi P3

- Kt hp v(P1 OR (P2 OR P3 )) = v((P1 OR P2 ) OR P3 ).

nh ngha 7:

Hm S :[0,1]2 [0,1] c gi l php tuyn (t- i chun) nu tha cc tin sau :

- S(0, x) = x, vi mi 0 x 1.

- S c tnh giao hon, ngha l : S(x,y) = S(y,x), vi mi 0 x,y 1.

9/14
L thuyt tp m v logic m

- S khng gim theo ngha : S(x,y) S(u,v), vi mi x u, y v.

- S c tnh kt hp : S(x,S(y,z)) = S(S(x,y),x), vi mi 0 x,y,z 1.

T cc tnh cht trn suy ra S(1,x) = 1.

V d :

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

S(x,y) = min(1, x+y)

S(x,y) = x + y - x.y

nh ngha 8:

Cho hai tp m A, B trn cng khng gian nn vi hm thuc v A(a), B(a). Cho
S l php tuyn , php hp ca hai tp m A, B l mt tp m trn vi hm thuc v
cho bi :

A?B(a) = = S(A(a), B(a)) , a

Vi S(x,y) = max(x,y) ta c :

A?B(a) = max(A(a), B(a)) ( xem hnh a)

Vi S(x,y) = min(1, x+y)

A?B(a) = min(1, A(a) + B(a)) (xem hnh b)

Vi S(x,y) = x + y + x.y

A?B(a) = A(a) + B(a) - A(a).B(a) (xem hnh c)

C th biu din giao ca cc tp m vi cc php ton trn bng cc th sau :

x x x A (x) B (x) A (x) B (x) A (x) B (x)

Hnh a: Hnh b Hnh c

V d : Cho = {1, 2, 3, 4, 5}, v A, B l cc tp m trong nh sau:

A = {(1,0), (2,1), (3,0.5), (4,0.3), (5,0.2)}

10/14
L thuyt tp m v logic m

B = {(1,0), (2,0.5), (3,0.7), (4,0.2), (5,0.4)}

Ta c : A B = {(1,0), (2,1), (3,0.7), (4,0.3), (5,0.4)}

A Ac = {(1,1), (2,1), (3,0.5), (4,0.7), (5,0.8)}

Mt s qui tc

Trong logic r vi hai gi tr ng, sai, c nhiu qui tc n gin m chng ta thng s
dng xem nh tnh cht hin nhin.

V d : vi bt k tp r A , ta c: A?Ac = v A ?Ac = .

Thc ra, nhng qui tc ny c c l nh vo s xy dng ton hc trc . Chuyn

sang l thuyt tp m th hai tnh cht quen dng ny khng cn ng na. Do ,
chng ta cn xem xt li mt s tinh cht.

Tnh ly ng (demportancy)

Chng ta ni T l ly ng nu T(x,x) = x, x[0,1].

Tng t, S l ly ng nu S(x,x) = x, x[0,1].

Tnh hp thu (absorption)

C hai dng hp thu :

- T(S(x,y),x) = x , x,y[0,1].

- S(T(x,y),x) = x , x,y[0,1].

Tnh phn phi (distributivity)

C hai biu thc xc nh tnh phn phi:

- S(x,T(y,z)) = T(S(x,y), S(x,z)), x,y,z[0,1].

- T(x,S(y,z)) = S(T(x,y), T(x,z)), x,y,z[0,1].

Lut De Morgan

Cho T l t-chun, S l t-i chun, n l php ph nh. Chng ta c b ba (T,S,n) l mt

b ba De Morgan nu :

11/14
L thuyt tp m v logic m

n(S(x,y)) = T(nx,ny)

Php ko theo

Chng ta s xt php ko theo nh mt mi quan h, mt ton t logic. Ta c cc tin

sau cho hm v(P1 P2) :

- v(P1 P2) ch ph thuc vo v(P1), v(P2).

- Nu v(P1) v(P3) th v(P1 P2) v(P3 P2), P2

- Nu v(P2) v(P3) th v(P1 P2) v(P1 P3), P1

- Nu v(P1) = 0 th v(P1 P) = 1 , P.

- Nu v(P1) = 1 th v(P P1) = 1 , P.

- Nu v(P1) = 1 v v(P2) = 0 th v(P1 P2) = 0.

Tnh hp l ca nhng tin ny da vo logic kinh in v nhng t duy trc quan

ca php suy din. T tin ban u (v(P1 P2) ch ph thuc vo v(P1), v(P2))
khng nh s tn ti ca hm s I(x,y) xc nh trn [0,1]2 vi mong mun tnh chn
tr ca php ko theo qua biu thc

v(P1 P2) = I(v(P1), v(P2))

nh ngha 9:

Php ko theo ca mt hm s I : [0,1]2 [0,1] tha cc iu kin sau :

- Nu x z th I(x,y) I(z,y), y[0,1].

- Nu y u th I(x,y) I(z,y), x[0,1].

- I(0,x) = 1, x[0,1].

- I(x,1) = 1, x[0,1].

- I(1,0) = 0

12/14
L thuyt tp m v logic m

nh ngha 10:

Cho T l t-chun, A l t-i chun, n l php ph nh. Hm IS(x,y) xc nh trn [0,1]2

bng biu thc :

IS(x,y) = S(n(x),y)

V d : Cho = {1, 2, 3, 4, 5}, v A, B l cc tp m trong nh sau:

A = {(1,0), (2,1), (3,0.5), (4,0.3), (5,0.2)}

B = {(1,0), (2,0.5), (3,0.7), (4,0.2), (5,0.4)}

Vi S(x,y) = max(x,y) v n(x) = 1 - x ta c :

Is (0,0) = S(n(0),0) = 1

Is (1,0.5) = S(n(1),0.5) = 0.5

Is (0.5,0.7) = S(n(0.5),0.7) = 0.7

Is (0.3,0.2) = S(n(0.3),0.2) = 0.7

Is (0.2,0.4) = S(n(0.2),0.4) = 0.8

Tng kt chng l thuyt m

Tt c nhng kin thc trnh by trong chng ny ch l phn c bn ca l thuyt tp

m v logic m. Chng ti khng i su vo chi tit m ch nhm mc ch trnh by cc
khi nim v cc php ton sinh vin nm bt c vn l bn cnh logic r cn
c logic m. Sinh vin c th tm hiu su hn v logic m nm th t trong phn ng
dng logic m vo iu khin t ng ha (dnh cho lp in t) hay ng dng logic
m trong tr tu nhn to. Tuy vy, hy vng rng vi cc c s kin thc nn v logic
mnh , suy lun ton hc, v t v l thuyt tp m trong gio trnh ny l hnh trang
hu ch i vo cc tri thc cao hn.

Bi tp l thuyt m v logic m

1. Cho ? = {6, 2, 7, 4, 9}, cc tp m A, B, C trn ? tng ng vi nh x A , B v C

nh sau:

A = {(6,0.2), (2,0.9), (7,0.5), (4,0.3), (9,0.2)}

13/14
L thuyt tp m v logic m

B = {(6,0), (2,1), (7,0.5), (4,0.6), (9,0.1)}

C = {(6,0.3), (2,0.1), (7,1), (4,0), (9,0.5)}

a/ Tnh cc tp AC, BC v CC vi hm thuc v l 1-x

b/ Tnh A B, B C, A B C, A CC, A CC vi T(x,y) = min(x,y)

c/ Tnh A B, B C, A B C, A CC, A CC vi S(x,y) = max(x,y)

2. Cho cc tp m A,B,C c nh ngha trn nn s nguyn = [0,5] vi cc hm

thuc v nh sau: A = x +x 2 v B = 1x

Hy xc nh cc tp m sau dng lit k v th :

a/ Tnh cc tp AC, BC v CC vi hm thuc v l 1-x

b/ Tnh A B, B C, A B C, A CC, A CC vi T(x,y) = min(x,y)

c/ Tnh A B, B C, A B C, A CC, A CC vi S(x,y) = max(x,y)

3. Thit lp m hnh phn loi sinh vin qua cc tp m sinh vin cn c, sinh vin thng
minh v sinh vin li.

4. Cho A l tp m xc nh trn nn X. Hy ch ra rng biu thc A CC = X khng

ng nh i vi tp hp kinh in.

5. Kim tra xem tp m A, B vi cc hm thuc v xc nh bi tp 2 l tha hai cng

thc ca De Morgan.

14/14