Chương 1. Lý thuyết tập mờ PDF

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 22

Bi ging mn hc LOGIC M V NG DNG

PGS.TS. Nguyn Vn nh, Khoa CNTT, Hc Vin NN Vit Nam

M u

Trong cuc sng, con ngi truyn thng tin cho nhau ch yu bng ngn ng t nhin.
Mc d ngn ng t nhin thng a ngha, khng chnh xc, v khng y , nhng n vn l
phng tin truyn thng tin mnh m v thng dng nht gia con ngi vi nhau. Vt qua tt
c cc hn ch ca ngn ng t nhin (thiu chnh xc, khng r rng vaguenees), con
ngi thng hiu ng v t khi hiu sai nhng iu m ngi khc mun ni vi mnh. y l
iu m my mc ni chung v my tnh ni ring khng th thc hin c mt cch hon ho.
Tham vng ca cc nh ton hc, logic hc v cng ngh thng tin l mun xy dng cho my
mc kh nng suy din v x l thng tin, tc l c kh nng hot ng nh b c ca con ngi
chng c th nhn nhng mnh lnh ca con ngi thng qua ngn ng t nhin v thc thi
nhng nhim v . Nh vy, vn t ra y l lm th no my tnh c th hiu v x l
c nhng tri thc din t bng ngn ng t nhin. t c iu ny, trc ht ngi ta
cn phi xy dng mt l thuyt logic ton cho php m t chnh xc ngha ca cc mnh
khng r rng, a ngha.
Logic ton hc c in nghin cu cc php suy lun vi cc mnh c gi tr chn l
(ng/sai) r rng. Chng hn ta c cc mnh trong logic c in:
p: hm nay tri ma , gi tr chn l ca p l T(ng) hay F (sai) l c th xc nh
c.
q: hm nay Trung ngh hc,s c gi tr chn l duy nht l T hoc F
r: tui ca Trung l 22 ...
Vi nhng mnh trn, logic c in c th p dng cc quy tc suy din, chng hn quy tc
modus ponens :
nu p q ng v p ng th q ng
do nu c lut tri ma th SV ngh hc th nu c p : hm nay tri ma l ng th s suy
ra q : hm nay Trung ngh hc l ng.
Tuy nhin trong thc t, c nhiu mnh cha nhng thng tin khng r rng, khng chnh
xc, chng hn ta thng gp nhng mnh :
p : A l ngi lp trnh gii
q : lng ca A l cao
r : A c cm tnh vi B
Nhng mnh trn y cha nhng thng tin khng chnh xc v khng y (gi l cc
thng tin m), chng hn: nh th no l lp trnh gii, cho nn khng th c gi tr chn l ca
p, hay lng ca A cao l bao nhiu, A cm tnh vi B n mc no ? Tt c nhng mnh
trn u khng th c gi tr chn l (ng/sai) r rng (gi l cc mnh m). Chng ta

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 1


cng khng th p dng quy tc modus ponens ca logic c in vi cc mnh m trn y,
suy ra A c lng cao l ng, d rng c lut : ngi lp trnh gii th c lng cao.
my tnh c th hiu c cc tri thc din t bng ngn ng t nhin cha ng nhng
thng tin m, ngi ta cn phi xy dng mt l thuyt logic mi, cho php m t chnh xc
ngha ca cc mnh c cha cc thng tin khng r rng, a ngha.
Vo nm 1965, Gio s Lotfi Zadeh - trng khoa in t thuc trng i hc
California, mt nh ton hc v logic hc ngi H Lan, xy dng thnh cng l thuyt tp
m v h thng logic m. Pht minh ny ca Zadeh cho php con ngi c th lng ha gi
tr cc mnh m, nh truyn t mt s thng tin cho my mc qua ngn ng t nhin, v
chng c th hiu kh chnh xc ni dung ca nhng thng tin . y l mt bc tin c
tnh t ph trong vic phin dch hay lng ha nhng mnh ca ngn ng t nhin, c cha
nhng thng tin khng chnh xc v khng y , (cc thng tin m) sang cc ngn ng hnh
thc, ngn ng lp trnh.

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 2


Chng I

L THUYT TP M

1.1 B TC CC KIN THC V TP HP

nghin cu cc tp hp m (FUZZY SET) v logic m (FUZZY LOGIC) trc ht ta


nhc li cc kin thc c bn v l thuyt tp hp c in (CRISP SET), cc nh x v cc quan
h trn cc tp hp. y l nhng kin thc nn tng ca ton hc, hu ht nhng kin thc ny
sinh vin ngnh Tin hc c hc tp trong cc nm u ca bc i hoc, tuy nhin, sinh vin
cn n li v chc chn rng mnh nm rt vng nhng kin thc ny trc khi bt u mn
hc Logic m v ng dng.

1.1.1 M t tp hp

Mt tp hp c m t l mt nhm cc i tng khng c s lp li. Mi i tng


ca tp hp c gi l mt phn t ca tp hp .
Cc ch ci in hoa (c th km theo ch s): A, B, C,..hay A1, A2, A3 thng c dng t
tn cho tp hp. Cc ch ci in thng (c th km theo ch s): a, b, c,..hay a1, a2, a3 thng
c dng ch cc phn t ca tp hp.

Nu s phn t ca tp hp l hu hn v khng qu ln ta c th c t tp hp bng


cch lit k tt c cc phn t ca n gia hai du ngoc {}, cc phn t trong tp hp
c vit cch nhau bi du phy , v khng quan tm n th t cc phn t trong
mt tp hp.
Nu phn t x l thuc tp hp A, ta vit x A (c: x thuc A), nu tri li, ta vit x A. (c x
khng thuc A).

Hai tp hp bng nhau l hai tp hp c cha cc phn t nh nhau.


Chng hn: Tp hp A = {1, 2, 3, 4, 5} l bng tp hp B, vi B = {2, 1, 4, 3, 5}, ta vit A = B.

Th d 1.1 Gi D l tp hp cc ngy trong tun, khi ta c th cho D bng cch lit k cc


phn t ca n:
D = {Mon, Tues, Wed, Thurs, Fri, Sat, Sun}
Ta c Mon D, Fri D, nhng September D.
Ngoi ra, tp hp: {Sat, Tues, Wed, Mon,Thurs, Fri, Sun} cng bng tp hp D.
Nu mt tp hp cha mt s kh ln cc phn t, hoc l v hn cc phn t, ngi ta c th
khng lit k tt c cc phn t ca tp hp, m dng cch c t tp hp theo mt s tnh cht
c trng ca cc phn t ca n.

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 3


Th d 1.2 C th cho mt s tp hp nh sau :
a/. D = {x | x l mt ngy trong tun }, D l tp cc ngy ca mt tun l,
b/. C = {z | z = a + ib, vi a, b R, i2 = -1}, C l tp hp s phc,
c/. X = {x | x > 5}, X l tp cc s thc c gi tr ln hn 5.
Ta ni tp hp A l tp hp con ca tp hp B v k hiu l A B, nu mi phn t ca
A cng l phn t ca B.
Ta ni tp hp A l tp hp con thc s ca tp hp B v k hiu l A B, nu A l tp hp con
ca B, v B c t nht mt phn t khng thuc A. Nu A c d ch mt phn t m khng phi
l phn t ca B th A khng phi l tp hp con ca tp hp B.
Nu A B th ta ni A b cha trong B, hay B cha A.
Nu A B th ta ni A b cha thc s trong B, hay B thc s cha A.
Hai tp hp A v B gi l bng nhau khi v ch khi A B v B A, v vit A = B.
Phng php chng minh hai tp hp bng nhau
chng minh 2 tp bng nhau, A = B, ta s chng minh hai bao hm thc A B v B A.
chng minh A B ta cn ch ra rng: vi phn t bt k x A th cng c x B, vi bao
hm thc ngc li B A cng chng minh tng t. (xem th d 1.5)
Mt trng hp c bit ca tp hp l tp hp rng, tp hp ny khng cha bt k
phn t no, v c k hiu l , hay { }. Tp hp rng c xem nh tp con ca mi
tp hp.
Tp hp tt c cc tp hp con ca tp hp A (k c chnh tp A v tp rng) gi l tp
hp ly tha ca A, k hiu 2A, tp hp ny cng c k hiu l P(A).
Lc lng ca tp hp A l s phn t ca A. K hiu lng ca tp hp A l | A |.
R rng ta c | 2A| = 2 | A |.

Th d 1.3. Mt s kt qu so snh cc tp hp :
a/. {1, 2, 3, 4} {2, 1, 4, 5, 3}
b/. {1, 2, 3, 4, 5}={5, 1, 2, 3, 4}
c/. Cho A = {1, 2, 3}th tp hp ly tha ca A l
2A = { , {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}}
Ta c | 2A| = 2 | A | = 23 = 8 phn t
Trong chuyn ny, t nay v sau, cho ngn gn, ta dng t tp thay cho tp hp.

1.1.2 Cc php ton trn tp hp

Cc tp hp c xt y c xem nh l cc tp con ca mt tp v tr X no . Cc php


ton xc nh trn tp hp l:
a. Phn b ca tp hp A trong X, k hiu A , l tp cc phn t ca X m khng thuc A.

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 4


A = {x X | x A }
b. Hp ca A v B, k hiu A B, l tp cc phn t thuc t nht mt trong hai tp A , B.
A B = {x | x A hoc x B}
c. Giao ca A v B, k hiu A B, l tp hp cc phn t ng thi thuc c A v B.
A B = {x | x A v x B}
d. Hiu ca A v B, k hiu A \ B (hoc A B), l tp cc phn t thuc A m khng thuc B
A \ B = {x | x A v x B}

Mt s tnh cht ca cc php ton trn tp hp:


Cho A, B, C l cc tp con ca tp v tr X, c th chng minh c cc tnh cht sau:
Mt s tnh cht v phn b (ph nh):

A A ; X =; =X
Giao hon:
AB=BA
AB=BA
Kt hp:
(A B) C = A (B C)
(A B) C = A (B C)
Phn b:
A (B C) = (A B) (A C)
A (B C) = (A B) (A C)
i ngu (cng thc Demorgan):

A B A B (1)
A B A B (2)
Lc lng ca hai tp hp:
| A | + | B | = |A B| + |A B|

1.1.3 Tich Decac ca cc tp hp

Tch Decac (Descartes Product) ca hai tp A v B l mt php ghp hai tp c tp hp


mi, k hiu A B:
A B = {(a, b) | a A, b B}
D thy rng lc lng ca tch Decac A B l: | A B | = | A | . | B |
C th m rng tch Decac cho nhiu tp hp:
A1 A2 An = {(a1, a2 , , an) | ai Ai , i = 1, 2, ...n}.
C th dng k hiu ly tha ch tch Decac ca cng mt tp hp:

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 5


Ak = A A ... A (k ln)
Th d 1.4: Cho R l tp s thc, biu din cc im trn ng thng, khi :
R2 = {(x, y) | x R, y R}biu din cc im trn mt phng,
R3 = {(x, y, z) | x R, y R, z R}biu din cc im trong khng gian,

Th d 1.5: Chng minh cng thc Demorgan th nht: A B A B

Ta cn chng minh hai bao hm thc : A B A B v A B A B .

Chng minh A B A B (a) :

Gi s x l phn t bt k m x A B , khi x A B, suy ra x A v x B, vy x


A B . Bao hm thc (a) c chng minh.

Vi bao hm thc A B A B (b) ta cng chng minh tng t.

T (a) v (b) suy ra A B A B .


Cc bn sinh vin t chng minh cng thc Demorgan th hai nh l mt bi tp.

1.1.4 Quan h trn cc tp hp

Trong nhiu vn , ta cn xem xt n mt mi quan h no gia cc phn t ca cc


tp hp. Trng hp n gin nht l xem xt quan h gia hai phn t ca mt tp hp. Nhng
cp phn t nh vy to nn mt tp con ca tch Decac X X, v c gi l mt quan h hai
ngi trn tp hp X.

Ta c nh ngha hnh thc cho mt quan h R trn tp X nh sau:

nh ngha 1.1.
Mt quan h hai ngi R (hay n gin l quan h R) trn mt tp hu hn cc phn t X, l mt
tp con ca tch Decac X X, k hiu l R(X).
Nu hai phn t a, b X c quan h vi nhau theo quan h R th ta vit aRb hay (a, b) R(X).
Chng ta quan tm n cc tnh cht sau ca mt quan h hai ngi R trn tp X:
Phn x: Quan h R c tnh phn x nu: aRa, a X
i xng: Quan h R c tnh i xng nu: aRb bRa
Bc cu: Quan h R c tnh bc cu nu: (aRb v bRc) aRc
Mi mt quan h c th c mt s hoc tt c ba tnh cht trn. Mt quan h s c gi l quan
h phn x, quan h i xng hoc quan h bc cu khi n c tnh cht tng ng.

Th d 1.6. Xt tp X = {1, 2, 3, 4}.


Ta xc nh cc quan h :
a/. Ta xc nh mi quan h L gia cc phn t ca X nh sau: vi a, b X, ta ni a c quan
h L vi b, nu a nh hn b. Vy quan h L trn X c xc nh bi tp hp:

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 6


L(X) = {(1,2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4) }
b/. Ta xc nh mi quan h D gia cc phn t ca X nh sau: vi a, b X, ta ni a c
quan h D vi b, nu a chia ht cho b. Vy quan h D trn X c xc nh bi tp:
D(X) = {(2, 1), (3, 1), (4, 1), (4, 2), (1, 1), (2, 2), (3, 3) (4, 4)}
D thy rng L l quan h bc cu trn X, nhng khng phi l i xng v phn x, cn
D l quan h phn x v bc cu trn X, nhng D khng phi l quan h i xng.
Ngi ta quan tm n mt loi quan h c bit, l quan h tng ng.

nh ngha 1.2.
Mt quan h hai ngi R trn X c gi l quan h tng ng nu R l quan h phn x, i
xng v bc cu; tc l: vi mi phn t a, b, c X th R tha cc tnh cht:
aRa, a X (Tnh phn x)
aRb bRa (Tnh i xng)
(aRb v bRc) aRc (Tnh bc cu)
Nu R l quan h tng ng trn X th mi cp phn t thuc R(X) c gi l tng ng
vi nhau (theo quan h R).

Th d 1.7. Xt tp m s t nhin: M = {1, 2, m}, vi mi cp s a v b thuc M, ta ni a


ng d vi b modulo k, nu a mod k = b mod k, ( 0 < k < m), v k hiu l:
a~b (mod k).
D thy rng nu a~b (mod k) th a b l mt bi s ca k.
C th thy rng quan h a~b (mod k) tha mn c ba tnh cht phn x, i xng v bc cu,
vy y l mt quan h tng ng.
Chng hn, vi m = 5, k = 2. Ta c M = {1, 2, 3, 4, 5}, Xt quan h R trn M l quan h
a~b(mod 2). Khi cc s a, b tha quan h R l nhng cp s khi chia cho 2 th c cng s d.
R(M) = {(1, 3), (1, 5), (2, 4), (3, 5), (3, 1), (5, 1), (4, 2), (5, 3), (1, 1) (2, 2), (3, 3), (4, 4), (5, 5)}
R rng R tha c 3 tnh cht phn x, i xng v bc cu, vy R l quan h tng ng.

Phn hoch ca tp hp: Mt quan h tng ng c th xc nh mt cch chia tp X


thnh cc tp con ri nhau gi l mt phn hoch ca tp X. C th, ta c nh ngha sau:

nh ngha 1.3.
Phn hoch ca tp hp X l tp P cc tp con ca X: P = {X1 , X2 , Xk }, trong Xi X ,
i = 1, 2, , k; X1X2Xk = X , XiXj = vi i j.
Mt quan h tng ng R trn tp hp X s chia tp X thnh cc lp tng ng, sao cho hai
phn t thuc cng mt lp l tng ng vi nhau (theo quan h R). Mt phn t a ca tp X
phi thuc v ng mt lp tng ng no , cha tt c nhng phn t tng ng vi a,
k hiu lp ny l C(a,R). Nh vy cc lp tng ng l cc tp con ri nhau ca X, v ph
kn tp X.
Do , mt quan h tng ng R trn mt tp hp s xc nh mt phn hoch trn tp hp
, v ngc li, mt phn hoch bt k trn mt tp hp s tng ng vi mt quan h tng
ng trn tp hp .

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 7


Tr li th d 1.6, chng hn, vi m = 5, k = 2, ta c M = {1, 2, 3, 4, 5}, ta gi R l quan h
tng ng a~b (mod 2) trn M, th R s chia tp M thnh hai lp tng ng l tp cc phn
t khi chia cho 2 s c cng s d :
C(1, R) = {1, 3, 5}
C(2, R) = {2, 4}
R rng l C(1, R) C(2, R) = M, v C(1, R) C(2, R) = nn cc lp tng ng trn lm
thnh mt phn hoch ca tp M, chia M thnh tp con cc s l v tp con cc s chn trong M..

Quan h th t: i khi, ta cn ch n mt tnh cht khc ca cc quan h, l tnh


phn i xng. Quan h R c tnh phn i xng nu: (aRb v bRa) (a = b). Ta c nh ngha:

nh ngha 1.4.
Quan h R trn tp X c gi l quan h th t nu n c ba tnh cht: phn x, phn i
xng v bc cu.

Th d 1.8. Trn tp X = {1, 2, 3, 4}xt quan h R: vi mi cp s a v b thuc X, ta ni aRb


nu a b.

Ta c R(X) = {(1,2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4), (1, 1) (2, 2), (3, 3), (4, 4)}

D thy rng R l mt quan h th t trn tp X.

Bao ng ca mt quan h. Cho quan h R trn tp hp X, gi s P l mt tp cc tnh


cht no ca cc quan h (chng hn tnh cht phn x, i xng hay bc cu).

nh ngha 1.5.
Bao ng P (P-closure) ca quan h R trn tp X, l mt quan h nh nht cha tt c cc
cp ca R, v nhng cp c suy dn ra t cc tnh cht trong P.

Ta xt hai loi bao ng sau ca quan h R.


Bao ng bc cu (bao ng truyn ng) ca R, k hiu R+ c xc nh nh sau:
- Nu (a, b) R th (a, b) cng thuc R+.
- Nu (a, b) R+ v (b, c) R th (a, c) R+.
Bao ng phn x v bc cu ca R, k hiu R* c xc nh nh sau:
R* = R+ {(a, a) | a X}
Th d 1.9. Cho quan h R = {(1, 2), (2, 2), (2, 3), (3, 4)} trn tp X = {1, 2, 3, 4},
Ta c: R+ = {(1, 2), (2, 2), (2, 3), (3, 4), (1, 3), (2, 4), (1, 4)}
Ta c: R* = {(1, 2), (2, 2), (2, 3), (3, 4), (1, 3), (2, 4), (1, 4), (1, 1), (2, 2), (3, 3), (4, 4)}

1.1.5 nh x trn cc tp hp

Gia cc tp hp c th c s tng ng gia mt (nhiu) phn t ca mt (nhiu) tp hp ny


vi cc phn t ca (cc) tp hp khc, khi ta c mt nh x gia cc tp hp . Trng hp
n gin nht, ta c nh ngha sau :

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 8


nh ngha 1.6
Cho hai tp hp A v B, nu c mt quy tc f cho tng ng mi phn t x A vi mt phn t
duy nht y B th ta ni c mt nh x f t A vo B, v k hiu l :
f : A B
Phn t y B m tng ng vi phn t x A c gi l nh ca x qua nh x f,
thng c k hiu l y = f(x).
Tp tt c nhng gi tr y B l nh ca x no trong A, gi l nh ca A qua nh x f,
c k hiu v xc nh nh sau:
f(A) = {y B | c x A y = f(x)}

T nh ngha nh x trn y, ch rng nh x f phi tha mn hai tnh cht:


(i) Mi phn t x A u c tng ng vi mt phn t y B. Tp A cn c gi l min
xc nh ca nh x f. (khng th c phn t no ca A khng c tng ng vo B)
(ii) C th c hai phn t khc nhau ca A cng tng ng vi mt phn t ca B, nhng
mt phn t ca A th khng th tng ng vi hai phn t khc nhau ca B.
Nu vi phm mt trong 2 tnh cht trn th php tng ng f khng phi l mt nh x.

nh ngha 1.7
Cho nh x f t A vo B, khi :
a/. nh x f : A B c gi l n nh nu nh ca cc phn t khc nhau l khc nhau.
Ni cch khc: nh x f gi l n nh nu vi mi x1, x2 A, m x1 x2, th f( x1) f( x2)
b/. nh x f : A B c gi l ton nh nu f(A) = B.
Ni cch khc: nh x f gi l ton nh nu vi bt k y B, c t nht mt phn t x A tng
ng vi y, tc l c x A sao cho y = f( x).
c/. nh x f : A B gi l song nh nu f va l n nh va l ton nh.

Ch :
1. Nu f : A B l mt nh x song nh, th tn ti nh x ngc t B vo A, k hiu f -1: B A,
ng mi phn t y B vi mt phn t x A m y = f(x).
nh x ngc f -1: B A cng l mt song nh v ch nh x song nh mi c nh x ngc
2. nh x n nh cn c gi l nh x 1 1; nh x ton nh cn gi l nh x ln v nh
x song nh cn gi l nh x 1 1 v ln.
3. nh x f : A B cng c gi l mt hm t A vo B. Khi cc tp A, B l cc tp con ca
tp s thc R, th cc nh x c gi l cc hm s.

Th d 1.10.
a/. Gi A l tp cc sinh vin trong 1 lp, B = {0, 1, 2, , 100}, php tng ng f ng mi sinh
vin vi 1 gi tr trong B l im thi mn ting Anh ca sinh vin (thang im 100, khng c

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 9


im l). R rng f l mt nh x t A vo B, v vi mi sinh vin u c im (tha mn tnh
cht (i), v mt sinh vin ch c mt im duy nht (tha mn tnh cht (ii) ca nh x).
b/. Php tng ng ngc li t B vo A khng phi l nh x, v c th vi mt gi tr trong B
ng vi nhiu sinh vin cng nhn gi tr l im (ph v tnh cht (ii) ca nh x. Ngoi ra,
c th c nhng gi tr ca B khng c sinh vin no c im nh vy (ph v tnh cht (i) ca
nh x). Php tng ng ph v t nht mt trong hai tnh cht trn th khng phi l nh x.
c/. Nu gi C l tp cc m sinh vin ca lp, th tng ng g mi sinhh vin vi m SV ca
mnh s l mt nh x va c tnh n nh, va c tnh ton nh, vy g l mt nh x song nh t
A vo C. Ta c nh x ngc t tp m sinh vin C vo tp sinh vin A: g -1: C A. R rng
nh x g -1 cng l mt song nh.
Cc bn sinh vin c th tm thm cc th d v cc loi nh x.

1.2 CC KHI NIM C S CA TP M

1.2.1. Khi nim tp hp m

Khi nim Tp hp m (Fuzzy Set) l m rng ca khi nim tp hp c in, nhm p


ng nhu cu biu din nhng tri thc khng chnh xc. Trong l thuyt tp hp c in (Crisp
set), quan h thnh vin ca cc phn t i vi mt tp hp c nh gi theo kiu nh phn
mt cch r rng : mi phn t u ca v tr tham chiu U l chc chn thuc tp A hoc chc
chn khng thuc tp A. Nh vy, xem mt phn t c l l thnh vin ca tp A hay khng,
ta gn cho phn t gi tr 1 nu phn t chc chn thuc A, v gi tr 0 nu n khng thuc
v tp hp A, tc l ta c th xy dng mt hm thnh vin (hay hm thuc) nh gi mt
phn t c thuc tp A hay khng :
1 if u A
u U , A (u )
0 if u A
R rng, hm thuc A s xc nh tp con c in A trn tp v tr U. vi A ch nhn gi tr
trong tp hp{0,1}.
Ngc li, l thuyt tp m cho php nh gi nhiu mc khc nhau v kh nng mt phn t
c th thuc v mt tp hp. Ta cng dng mt hm thnh vin (hm thuc) xc nh cc
mc m mt phn t u thuc v tp A : u U , 0 A (u ) 1 .

Chng hn, xt v tr tham chiu l cc nhn vin trong 1 cng ty, gi A l tp nhng ngi c
mc lng t 6 triu n 8 triu ng, th A l 1 tp r, gm tt c nhng ngi c mc lng
S, m 6000000 S 8000000. R rng ai c lng 5.990.000 hay 8.010.000 l khng thuc
tp A.
Nu ta coi mc lng t 6.000.000 tr ln l mc thu nhp cao, th c nhng ngi c mc
lng thp hn 6.000.000 vi chc ngn n vi trm ngn ng vn c th c xem l thuc
tp hp nhng ngi c thu nhp cao. Tp A trn l tp hp theo ngha c in (tp r), cn
tp B : nhng ngi c thu nhp cao l tp m, mi phn t ca v tr tham chiu u c
gn mt gi tr ch mc thuc tp m ny, chng hn mt nhn vin c mc lng 6.800.000

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 10


c thuc vo tp B ny l bng 1 (chc chn l ngi c thu nhp cao), nhng mt ngi c
mc lng 2.000.000 th c th coi l thnh vin ca tp ny vi thuc rt thp, thuc s
tng dn vi nhng ngi c mc lng cng cao. Nhng ngi c thu nhp di 1.000.000
th chc chn khng th thuc tp B (mc l thnh vin i vi tp B l bng 0).
Ta c nh ngha hnh thc cho mt tp con m trn mt v tr tham chiu nh sau :

nh ngha 1.8.
Cho U l mt v tr tham chiu, tp con m A trn U c xc nh bi hm thuc A, gn cho
mi phn t u ca U, mt gi tr A(u), vi 0 A(u) 1, ch mc m phn t u thuc v
tp m A. Ni cch khc, tp con m A trn U c xc nh bi nh x :
A : U [0, 1]
Tp con m A trn U xc nh bi hm thuc A : U [0, 1] c th c biu din nh sau :
Vi U l tp ri rc cc gi tr, U = {u1, u2, ...,un} tp m A trn U c biu din:
A = { A (u 1 )/u 1 , A (u 2 )/u 2 ,, A (u n )/u n | u i U, i = 1, 2, , n }
Vi U l min khng m c, tp m A trn U c biu din bng k php:

A= U
A (u ) / u

K php trong cch biu din th hai ny khng lin quan g n tch phn, ch c ngha rng vi
mi phn t u ca min v tr U (U l min lin tc hoc khng m c) u c gn vi
mt thuc ca u vo tp m A.
Nu hm A(u) cho kt qu 0 i vi phn t u U th phn t khng c trong tp cho, kt
qu 1 th phn t hon ton thuc tp cho. Cc gi tr trong khong m t 0 n 1 c
trng cho cc phn t m, tc l mc l thnh vin ca phn t i vi tp hp d cho.
Trng hp c bit, nu hm A(u) ch ly gi tr bng 0 hay 1, tc l A : U {0, 1}, th tp
con m A l mt tp con c in ca U. Nh vy, tp con c in (tp r) l mt trng hp
ring ca tp con m.

Th d 1.11. Xt tp U gm 8 cn h c k hiu l u1, u2, u3, u4, u5, u6, u7 v u8, mi cn h


c s phng tng ng l 1, 2,,8 phng. Gi A l tp hp gm cc cn h rng, B l tp
hp gm cc cn h thch hp cho 4 ngi. Ta xy dng hm thuc cho cc tp m A v B
nh sau:
A : A(u3) = 0.4; A(u4) = 0.5; A(u5) = 0.6; A(u6) = 0.8; A(u7) = 0.9; A(u8) = 1.0
B : B(u3) = 0.4; B(u4) = 1.0; B(u5) = 0.7; B(u6) = 0.5,
i vi cc phn t khc, cc gi tr ca hm thuc l bng 0.
Nh vy c th biu din cc tp m trn nh sau:
A = {0.4/u3; 0.5/u4; 0.6/u5; 0.8/u6; 0.9/u7; 1.0/u8}
B = {0.4/u3; 1.0/u4; 0.7/u5; 0.5/u6}.
Nu gi C l tp cc cn h c s phng khng qu 4 th r rng C = {u1, u2, u3, u4}l mt tp
con c in (tp r) ca U, Tuy nhin c th coi C l tp con m trn U vi hm thuc C nh
sau:

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 11


C(u1) = 1.0; C(u2) = 1.0; C(u3) = 1.0; C(u4) = 1.0, C(u5) = C(u6 ) = C(u7) = C(u8) = 0.
Biu din C di dng tp con m trn U:
C = {1.0/u1 ; 1.0/u2 ; 1.0/u3 ; 1.0/u4}

Thut ng Tp m l c dch t Fuzzy set, vi mc ch phn bit vi Tp r (Crisp


Set). Thc ra phi dng thut ng Tp con m ca mt tp v tr no . Tuy nhin, cho
gn ta c th dng Tp m thay cho Tp con m m khng gy ra sai st v hiu lm no.

1.2.2 Cc c trng ca tp m

Cc c trng ca mt tp m A trn U, l nhng thng tin m t v cc phn t lin quan


n tp m A, nhng c trng ny cn ch r s khc bit ca tp m A, so vi nhng tp con
c in khc ca U.

nh ngha 1.9.
Gi ca tp m A (Support) l tp cc phn t c gi tr hm thuc ln hn 0 trong tp m
A, c k hiu v xc nh nh sau:
supp(A) = {u | u U | A(u) > 0}

nh ngha 1.10.
Chiu cao ca tp m A (Hight) l gi tr ln nht m hm thuc c th ly trong tp m A,
c k hiu v xc nh nh sau:
h(A) = sup{A (u ), u U }

Ch rng nu U l tp ri rc th h(A) = max { A (u ), u U }

nh ngha 1.11.
Tp m A gi l chun ha nu chiu cao ca n h(A) = 1
Nh vy tp m A trn U c gi l chun ha, nu chc chn c t nht 1 phn t ca U l tht
s thuc A.

nh ngha 1.12
Ht nhn ca tp m A (Kernel) l tp cc phn t c gi tr hm thuc bng 1, c k hiu v
xc nh nh sau:
ker(A) = {u | uU | A(u) = 1}
Nh vy, tp m A c nhn khc rng khi v ch khi A l tp m chun ha.

nh ngha 1.13.
Lc lng ca tp m A c k hiu v xc nh nh sau:
|A|=
uU
A (u )

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 12


Ch rng nu A l tp r th A(u) = 1 vi mi u thuc A, tng trn bng s phn t ca A,
trng vi nh ngha lc lng ca tp hp c in.

nh ngha 1.14
- nht ct ca tp m A (hay tp mc ca A) l tp cc phn t c gi tr hm thuc ln hn
hoc bng , vi [0, 1], c k hiu v nh ngha nh sau:
A = {u | uU | A(u) }
Ch rng - nht ct ca tp m A l 1 tp r, cc phn t ca A hon ton c xc nh.

Th d 1.12. Xt tp m A trong th d 1.11:


A = {0.4/u3; 0.5/u4; 0.6/u5; 0.8/u6; 0.9/u7; 1.0/u8}
Gi , ht nhn, chiu cao, tp mc ca tp m A c xc nh nh sau:
supp(A) = {u3, u4, u5, u6, u7, u8}
ker(A) = u8
h(A) = 1.0
A l tp m chun ha, do c h(A) = 1.
Nht ct mc = 0.5 ca tp m A: A0.5 = {u4, u5, u6, u7, u8}; A0.9 = {u7, u8}

1.2.3. S m v cc tp con m li

Khi U l mt tp s thc R (hoc l tp con ca tp R), biu din cc gi tr bng s nh chiu


cao, khong cch, trng lng, tui tc, mc lng, nhit ..th cc tp con m trn U biu din
cc gi tr m nh gn, xa, cao, thp, nng, nh, tr, gi...Cc tp con m trn R c hm thuc
l hm li c gi l cc tp m li, c trng cho cc i lng m trn tp s thc.

1.2.3.1 Tp m li v s m

nh ngha 1.15.
Mt tp con m A trn tp s thc R l tp m li nu vi mi cp phn t a, b R v vi
mi s thc [0, 1], hm thuc ca A tha mn:
A(a + (1 - )b) min {A(a), A(b)}
Tp con m A trn tp s thc c gi l mt s m, nu A l tp m li v chun ha.
Trong chuyn ny, chng ta ch yu nghin cu cc tp con m trn v tr tham chiu l tp
s thc R. Trong hu ht cc trng hp, khi v tr tham chiu l tp s thc R, ta c th ng
nht khi nim tp con m v s m.

Th d 1.13. Xt tp H cc ngi nh gn bi binti mt a phng, thng thng ta c th


hiu cch bi bin 50m l gn, hay c th cch bi bin n 200m vn l gn, trn 200m th tnh
cht gn bi bin s t dn i, v t 500m tr ln th khng cn coi l gn bi bin na. C th
biu din nhng tri thc trn bng mt tp m, nu gi A l tp khong cch n bi bin ca
cc ngi nh gn bi bin th A s l tp con m trn R, vi hm thuc l:

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 13


1 if 0 u 200
500 u

u R, A (u ) , if 200 u 500
300
0 if u 500

th ca s m A trong th d 1.13 nh sau:

Khong cch (m)


200 500
Hnh 1.1
Hm thuc A trn y l mt hm li, tp m A xc nh bi A l tp m li, A l tp m
chun ha, vy A c gi l mt s m.

1.2.3.2 Cc kiu hm thuc ca tp m

Kiu ca tp m ph thuc vo cc kiu hm thuc khc nhau. c nhiu kiu hm thuc khc
nhau c xut. Di y l mt s hm thuc tiu biu.

1. Tp m tam gic. Cc tp m ny xc nh bi hm thuc vi 3 tham s l cn di a, cn


trn b v gi tr m (ng vi nh tam gic), vi a < m < b. Hm thuc ny c gi l hm thuc
ab
tam gic, c gi l i xng nu nu gi tr b m bng gi tr m a, hay m =
2
0 if u a, or u b
u a
, if a u m
m a
A (u )
b u , if m u b
b m
h if u m , vi h 1

th ca cc hm thuc tam gic (khng i xng v i xng) c dng:
A(u) A(u)

h h

0 a m b u 0 a m b u
Hnh 1.2 Cc tp m tam gic.

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 14


2. Tp m hnh thang. Hm thuc ca tp m ny gi l hm thuc hnh thang, xc nh bi
b 4 gi tr a, b, c, d theo cng thc sau:
0 if u a, or u d
u a
, if a u b
b a
A (u )
d u , if c u d
d c
h if b u c , vi h 1

th ca hm thuc hnh thang c dng sau:
A(u)

0 a b c d u
Hnh 1.3. Tp m hnh thang

3. Tp m L. Hm thuc ca tp m ny gi l hm thuc L, c xc nh nh sau:


h if u a, vi h 1
b u

A (u ) , if a u b
b a
0 if u b
th ca hm thuc L c dng sau:
A

0 a b u

Hnh 1.4 Tp m L
Hm thuc trong th d 1.13 trn y c dng hm thuc L, vi a = 100, b = 500.

4. Tp m Gamma tuyn tnh (hay L tri). Hm thuc ca tp m ny gi l hm thuc


Gamma tuyn tinh (hay hm thuc L- tri, c dng ngc vi hm thuc L), c xc nh bi
hai tham s a v b theo cng thc sau:

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 15


0 if u a,
u b

A (u ) , if a u b
b a
h if u b , vi h 1
th ca hm thuc gama tuyn tnh c dng sau:
A

0 a b u
Hnh 1.5 Tp m Gamma tuyn tnh.

5. Hm thuc Singleton. y l hm thuc cho tp A c ng mt phn t u = m, c gi tr 0


ti tt c cc im trong tp v tr, ngoi tr ti im m hm c gi tr 1. Hm thuc Singleton
ca A k hiu v xc nh nh sau:
1 if u m
SGA (u )
0 if u m
th ca hm Singleton:
SGA(u)

0 m u
Hnh 1.6 Tp m Singleton.
Trong hu ht cc trng hp ng dng l thuyt tp m th v tr tham chiu l tp s thc R
v cc kiu ca hm thuc thng gp cc dng trn, l nhng hm li tuyn tnh. Trong trng
hp tng qut, ta c hm thuc l cc hm li tng qut, c th tuyn tnh hoc phi tuyn, cc
vn l thuyt tp m di y u c trnh by vi nhng hm li tng qut.
Chng hn, khi u l cc s thc, ta c th v th hm thuc A cng vi cc c trng ca tp
m A: gi , ht nhn, -nht ct nh hnh sau:

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 16


A(u)

1.0

0 u

ker (A)
A
supp(A)
Hnh 1.7 Gi , ht nhn v - nht ct ca tp m A

1.3 CC PHP TON TRN TP M

Tng t nh l thuyt tp hp, trn cc tp m cng nh ngha cc khi nim bng


nhau, bao hm nhau v mt s php ton nh: php hp, php giao, tch Descartes, ca 2 tp
m, l s m rng cc php ton tng ng trong l thuyt tp hp c in.

1.3.1 So snh cc tp m

so snh cc tp con m A, B trn cng v tr tham chiu U, ta xem xt cc hm thuc ca n.

nh ngha 1.16.

Cho A v B l hai tp con m trn v tr tham chiu U vi hai hm thuc tng ng l A v B,


khi ta c:
Hai tp m A v B gi l bng nhau: k hiu A = B, nu u U th A(u) = B(u) .
Tp m A cha trong tp m B: k hiu A B, nu u U th A(u) B (u).
T nh ngha 1.3, ta thy hai tp m l bng nhau, khi mi phn t ca tp ny cng thuc tp
kia (vi cng thuc) v ngc li. iu ny hon ton tng t khi nim bng nhau ca hai
tp hp c in. Ngoi ra, tp m A l tp con ca tp m B nu mt phn t bt k thuc A th
cng thuc B (vi thuc khng thp hn thuc ca phn t i vi A), iu ny cng
tng t nh i vi cc tp hp c in.

1.3.2 Cc php ton trn cc tp m

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 17


Cng nh vi cc tp hp c in, ta c cc php ton hp, giao, ly phn b v tch Decac ca
cc tp con m. Cc php ton ny c nh ngha thng qua cc hm thuc ca cc tp con
m.

1.3.2.1 Php hp v php giao ca cc tp con m

nh ngha 1.17.
Hp ca hai tp m A v B trn U, k hiu A B, l mt tp m trn U vi hm thuc c k
hiu AB(u) v xc nh nh sau:
u U, AB(u) = max{A(u), B (u)}

th hm thuc ca hp m A, B v tp m A B c cho trong hnh sau:

Hnh 1.8 Hp ca hai tp m A v B

nh ngha 1.18.
Giao ca hai tp m A v B trn U, k hiu A B, l mt tp m trn U vi hm thuc c k
hiu A B(u) v c xc nh nh sau:
u U, AB(u) = min{A(u), B (u)}

th hm thuc ca hp m A, B v tp m A B c cho trong hnh sau:

Hnh 1.9 Giao ca hai tp m A v B


Mt s tnh cht ca php hp v php giao cc tp m:

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 18


1. Giao ca hai tp m li cng l mt tp m li, nhng hp ca hai tp m li th cha chc
l tp mt m li.
2. Cc tnh cht giao hon, kt hp v phn b ca php hp v php giao trong l thuyt tp hp
c in vn ng i vi php hp, php giao ca cc tp con m. Tc l nu A, B, C l cc tp
con m trn v tr tham chiu U, ta c cc cng thc sau:
Giao hon:
AB=BA
AB=BA
Kt hp:
(A B) C = A (B C)
(A B) C = A (B C)
Phn b:
A (B C) = (A B) (A C)
A (B C) = (A B) (A C)

Ni chung, nhng cng thc ca tp hp c in ch lin quan n php hp v php giao, th


cng ng i vi cc tp con m, chng hn: AB A AB, AU = A, AU = U,

1.3.2.2 Phn b ca mt tp con m


Trong tp hp c in, phn b ca mt tp hp cha nhng phn t khng thuc tp (trn
cng tp v tr tham chiu). i vi tp con m A trn U, phn b ca A, k hiu l A , cha
nhng phn t vi thuc cng cao nu thuc ca phn t ny vo A cng nh. Ni cch
khc, mt phn t cng t c kh nng thuc vo tp m A th cng c nhiu kh nng thuc vo
phn b A , nh vy A cng l mt tp con m trn U, v c nh ngha nh sau:

nh ngha 1.19.

Phn b ca tp m A, k hiu A l mt tp con m trn U vi hm thuc c k hiu A (u)


v xc nh nh sau:
u U, A (u) = 1- A(u)

th hm thuc ca tp m A v tp m A nh sau:

Hnh 1.10 Phn b ca tp m A


Mt s tnh cht ca php ly phn b cc tp m:

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 19


1. i vi cc tp con c in trn tp v tr U, ta lun c A A = v A A = U , nhng
i vi cc tp m th hai tnh cht ny ni chung khng ng, tc l nu A l phn b ca tp
m A trn U th:
A A , v

A A U.
y l im khc nhau quan trng gia cc tp con c in v cc tp con m.
2. Cc tnh cht khc i vi phn b ca tp con c in vn ng cho cc tp con m, tc l
nu A, B l cc tp con m trn U th ta c :
Mt s tnh cht v phn b (ph nh):

A A; U = ; = U
Cc cng thc i ngu (cng thc De Morgan):
A B A B (1)

A B A B (2)
Th d 1.14. Tr li cc tp m A, B trong th d 1.11:
A l tp hp cc cn h rng. A = {0.4/u3; 0.5/u4; 0.6/u5; 0.8/u6; 0.9/u7; 1.0/u8}
B l tp hp cc cn h thch hp cho 4 ngi. B = {0.4/u3; 1.0/u4; 0.7/u5; 0.5/u6}
Khi ta c:
A B = {Cc cn h thch hp cho 4 ngi hoc rng}
= {0.4/u3; 1.0/u4; 0.7/u5; 0.8/u6; 0.9/u7; 1.0/u8}
A B = {Cc cn h thch hp cho 4 ngi v rng}
= {0.4/u3; 0.5/u4; 0.6/u5; 0.5/u6}
A = {Cc cn h khng rng}
= {0.6/u3; 0.5/u4; 0.4/u5;0.2/u6; 0.1/u7}
A A = {0.4/u3 ; 0.5/u4 ; 0.4/u5 ; 0.2/u6 ; 0.1/u7}

1.3.2.3 Tch Descartes ca cc tp con m


Trc ht ta nh ngha tch Decac ca 2 tp con m A v B trn cc v tr tham chiu tng
ng U v V, gi s U v V l c lp vi nhau.

nh ngha 1.20.
Cho A v B l hai tp con m c cc hm thuc A v B trn cc v tr tham chiu tng ng
U v V, khi tch Descartes ca A v B l mt tp con m k hiu l A B trn v tr tham
chiu U V, vi hm thuc l A B c xc nh nh sau:
(u,v) UV, AB (u,v) = min{A(u), B( v)}
Tng t nh trong l thuyt tp hp c in, ta c th m rng nh ngha tch Decac cho k tp
m trn cc v tr tham chiu c lp:

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 20


nh ngha 1.21.
Tch Descartes ca k tp m A1, A2,...Ak trn cc v tr tham chiu U1,U2,..,Uk l mt tp con m
k hiu l A1 A2 ... Ak trn v tr tham chiu U1 U2 ... Uk , vi hm thuc l A1 A2.. Ak
c xc nh nh sau:
u=(u1, u2,..uk,) U1 U2 ... Uk , A1 A2.. Ak (u) = min{A1(u1), A2( u2),..., Ak( uk)}

Da trn cc nh ngha v tch Descartes ca cc tp con m, chng ta s nghin cu cc quan


h m trong cc phn sau.

Bi tp chng 1

1. Cho A, B, C l cc tp con c in ca tp v tr X, hy chng minh cc tnh cht sau:

a/. A A ; X = ; = X
b/. A B = B A ; A B = B A
c/. (AB) C = A (BC) ; (AB) C = A (BC)
d/. A (BC) = (AB) (AC) ; A (BC) = (AB) (AC)
e/. A B A B ; A B A B
f/. | A | + | B | = |A B| + |A B|
2. Cho A, B l cc tp con c in ca tp v tr X. C th dng hm thuc biu din cc tp
con A, B nh sau:
1 if u A 1 if u B
x X , A ( x) v x X , B ( x)
0 if u A 0 if u B
Hy xy dng cc hm thuc biu din cc tp AB ; AB v A .
3. Cho A, B, C l cc tp con c in ca tp v tr X. Hy dng hm thuc chng minh cc
cng thc sau, bng cch ch ra rng vi mi cng thc th hm thuc ca tp hp v tri bng
hm thuc ca tp hp v phi.
a/. A(BC) = (AB) (AC) ; A (BC) = (AB) (AC)
b/. A B A B ; A B A B
4. Vi nhng tri thc cho trong th d 1.13:
a/. Hy xy dng v v th hm thuc ca tp m B l khong cch n bi bin ca nhng
ngi nh khng gn bi bin. Hm thuc ny c phi l hm li khng?
b/. Hy xy dng v v th hm thuc ca tp m C l khong cch n bi bin ca nhng
ngi nh cch bin khong 300 n 400 m, chp nhn sai s n 50 m.
c/. Xc nh tp m ch khong cch ca nhng ngi nh khng gn bi bin, nhng cch bi
bin khong 300-400m.
5. Cho A l tp con m trn tp v tr U, chng minh rng vi mi , [0, 1], nu th
A A , vi A v A l cc nht ct mc v ca tp m A.

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 21


6. Cho A, B l cc tp con m trn tp v tr U, chng minh rng vi mi mc [0, 1], nhng
nht ct mc ca cc tp m A, B, AB, AB tha mn cc tnh cht sau:
a/. (AB) = A B
b/. (AB) = A B
c/. nu A B th A B
7. Xt tp U gm 5 ng c vin vo chc v qun c phn xng, U = {u1,u2,u3,u4,u5 }, h
c la chn theo hai tiu chun: A trnh nghip v (mc lnh ngh), v B - kinh
nghim ngh nghip. Tp th c kin nh gi v mc ph hp ca cc ng vin vi cc
tiu chun A v B nh sau:
U Tiu chun A Tiu chun B
u1 kh ph hp tng i ph hp
u2 hon ton ph hp kh ph hp
u3 rt ph hp hon ton ph hp
u4 t ph hp khng ph hp
u5 tng i ph hp rt ph hp

Cc mc ph hp c xp loi nh sau:
- hon ton ph hp: mc ph hp 1;
- rt ph hp: mc ph hp0.8;
- kh ph hp: mc ph hp 0.6;
- tng i ph hp: mc ph hp 0.4;
- t ph hp: mc ph hp 0.2
- khng ph hp: mc ph hp: 0;
Gi A v B l cc tp con m nhng ngi tha tiu chun A v B tng ng. Vit biu din ca
cc tp con ny.
a/. Tm tp con m ca U nhng ng vin tha t nht mt trong hai tiu chun
b/. Tha c hai tiu chun.
c/. Khng tha tiu chun A.
d/. Tm nht ct mc ca tp m nhng ng vin tha c 2 tiu chun, vi = 0.6 v = 0.8.

Bi ging Chuyn Logic m v ng dng nvdinh@vnua.edu.vn 22

You might also like