Professional Documents
Culture Documents
Lý Thuyết Tập Mờ Và Logic Mờ
Lý Thuyết Tập Mờ Và Logic Mờ
L thuyt tp m v logic m
Bi:
unknown
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
3/14
L thuyt tp m v logic m
int
L thuyt tp m v logic m
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
L thuyt tp m v logic m
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
9/14
L thuyt tp m v logic m
10/14
L thuyt tp m v logic m
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
13/14
L thuyt tp m v logic m
14/14