I HC QUC GIA H NI

TRNG I HC CNG NGH

H KHNH L

MT S QUY TRNH SUY DIN

TRONG H M

Ngnh:

Cng ngh thng tin

Chuyn ngnh:

H thng thng tin

M s:

60.48.05

LUN VN THC S
NGI HNG DN KHOA HC:
PGS. TSKH. Bi Cng Cng

ii

H Ni 2009

iii

LI CAM OAN
Ti xin cam oan lun vn Mt s quy trnh suy din trong h M l cng
trnh nghin cu ca ring ti, khng sao chp ca bt k ai. Ni dung ca lun n
c trnh by t nhng kin thc tng hp ca c nhn, tng hp t cc ngun ti
liu c xut x r rng v trch dn hp php. Kt qu nghin cu c trnh by
trong lun vn ny cha tng c cng b ti bt k cng trnh no khc.
Ti xin chu hon ton trch nhim, v nu sai, ti xin chu mi hnh thc k
lut theo quy nh.
H Ni, ngy 7 thng 12 nm 2009
Hc vin thc hin
H Khnh L

iv

LI CM N
u tin, ti xin gi li cm n su sc nht ti PGS.TSKH Bi Cng
Cng, ngi hng dn khoa hc, tn tnh ch bo, gip v to iu kin
cho ti hon thnh lun vn.
Ti xin chn thnh cm n cc thy c trng i hc Cng ngh, i hc
Quc gia H Ni ging dy v truyn t kin thc cho ti.
Cui cng, ti xin cm n nhng ngi thn v cc bn b ng nghip
chia s, gip ti hon thnh lun vn ny.
Mc d ht sc c gng vi tt c s n lc ca bn thn, nhng chc lun
vn vn cn nhng thiu st. Knh mong nhn c nhng kin ng gp ca
qu Thy, C v bn b ng nghip.
Ti xin chn thnh cm n!

H Ni, ngy 7 thng 12 nm 2009

Hc vin thc hin
H Khnh L

MC LC
Trang
Trang ba ph............................................................................................................................
LI CAM OAN..................................................................................................................iii
LI CM N........................................................................................................................iv
MC LC..............................................................................................................................v
BNG K HIU CC CH VIT TT............................................................................vii
DANH MC CC BNG...................................................................................................vii
DANH MC CC HNH V, TH..............................................................................vii
M U................................................................................................................................1
CHNG I - C S LOGIC M.........................................................................................3
1.1. Logic r v s xut hin ca logic m......................................................................................3
1.2. Cc php ton v tp m...........................................................................................................4
1.2.1. Php ph nh..................................................................................................................4
1.2.2. T - chun...........................................................................................................................5
1.2.3. T - i chun...................................................................................................................10
1.3. Mt s vn lin quan ca cc ton t trong Logic M .....................................................16
1.3.1. Php i ngu ................................................................................................................16
1.3.2. Quan h gia t - chun v t - i chun......................................................................16
1.3.3. Mt s qui tc vi php hi v php tuyn.................................................................17
1.4. Php ko theo...........................................................................................................................19
1.4.1. nh ngha php ko theo.............................................................................................19
1.4.2. Mt s dng hm ko theo c th................................................................................21
1.4.3. th mt s hm ko theo c quan tm...............................................................26
1.5. Quan h m v php hp thnh...............................................................................................27
1.5.1. Quan h m....................................................................................................................28
1.5.2. Php hp thnh..............................................................................................................28

CHNG 2 LUT M V H SUY DIN M............................................................30

2.1. H m trn c s cc lut m..................................................................................................30
2.1.1. nh ngha lut m........................................................................................................30
2.1.2. nh ngha h m trn c s cc lut m...................................................................32
2.2. H suy din m........................................................................................................................33
2.2.1. Kin trc c bn ca h suy din m..........................................................................33
2.2.3. Cc bc suy din m...................................................................................................34
2.2.4. Mt s phng php suy din trong h m................................................................39

CHNG III - LP LUN XP X TRONG H M TRN C S CC LUT M..42

vi
3.2. M hnh ngn ng - Linguistic models (LM).........................................................................42
3.3. Suy din vi m hnh m........................................................................................................43
3.4. M hnh Mamdani (Constructive) v Logical (Destructive)..................................................45
3.4.1. Phng php lp lun Mandani..................................................................................46
3.4.2. Phng php lp lun logic..........................................................................................49
3.5. M hnh ngn ng vi tp hp cc u ra..............................................................................54
3.6. M hnh Takagi Sugeno Kang (TSK)...............................................................................56
3.6.1. M hnh...........................................................................................................................56
3.6.2. Mt s v d m hnh TSK n gin...........................................................................58

CHNG 4 B CNG C LOGIC M CA MATLAB V CI T TH THUT

TON...................................................................................................................................60
4.1. Gii thiu chung mi trng MATLAB.................................................................................60
4.2. B cng c Logic M (Fuzzy logic toolbox)..........................................................................61
4.2.1. Gii thiu........................................................................................................................61
4.2.2. Cc tnh nng c bn ca FLT.....................................................................................64
4.2.3. Xy dng h suy din bng GUI ca FLT..................................................................64
4.2.4. Cu trc ca h suy din m trong Matlab ...............................................................66
4.3. Bi ton v d v ci t th thut ton 1, 2............................................................................67
4.3.1. Bi ton iu khin tn hiu n giao thng...............................................................67
4.3.2. Tiu ch v rng buc....................................................................................................68
4.3.3. Thit k b iu khin giao thng m ........................................................................69

KT LUN..........................................................................................................................76
DANH MC CNG TRNH CA TC GI.....................................................................77
TI LIU THAM KHO....................................................................................................78

vii

BNG K HIU CC CH VIT TT

K hiu

Tn y

LM

Linguistic Model

TSK

Takagi Sugeno Kang Model

FIS

Fuzzy Inference System

FLT

Fyzzy Logic Toolbox

DANH MC CC BNG
Trang
Bng 1.1: Cc cp i ngu vi n(x) = 1-x..........................................................................17
Bng 2.1: Phng php gii m trung bnh tm vi m = 2..................................................39

DANH MC CC HNH V, TH
Trang
Hnh 1.2: th t-chun yu nht T0.....................................................................................7
Hnh 1.2: th t-chun Lukasiewiez....................................................................................8
Hnh 1.3: th t-chun T2....................................................................................................8
Hnh 1.4: th t-chun t(x,y) = x*y.....................................................................................8
Hnh 1.5: th t-chun min..................................................................................................8
Hnh 1.5: th t-chun Min-Nilpotent.................................................................................9
Hnh 1.6: th t-chun T4....................................................................................................9
Hnh 1.7: Giao ca 2 tp m dng tch.................................................................................10
Hnh 1.8: Giao ca 2 tp m dng min.................................................................................10
Hnh 1.8: th hm t-i chun SN...................................................................................13
Hnh 1.9: th T-i chun SM.........................................................................................13
Hnh 1.10: th T-i chun SP........................................................................................13
Hnh 1.11: th T-i chun S2........................................................................................14
Hnh 1.13: th T-i chun S4........................................................................................14
Hnh 1.14: th T-i chun SL........................................................................................14
Hnh 1.15: th T-i chun S0........................................................................................14
Hnh 1.16: Hp ca hai tp m dng Max............................................................................15

viii
Hnh 1.17: Hp ca hai tp m dng Lukasewiez................................................................16
Hnh 1.18: th IQL= 1-x+x2y..........................................................................................23
Hnh 1.19: th IQL= max(y,1-x).....................................................................................24
Hnh 1.20: th I(x,y)=max(1-x,min(x,y))........................................................................26
Hnh 1.21: th hm I(x,y) - Godeh..................................................................................27
Hnh 1.22: th hm I(x,y) - Goguen................................................................................27
Hnh 2.1: ng c iu khin tc khng kh. .................................................................31
Hnh 2.2: Cu trc c bn ca h suy din m ....................................................................33
Hnh 2.3: Gii m bng phng php cc i......................................................................37
Hnh 2.4: Gii m bng phng php trung bnh.................................................................37
Hnh 2.5: Gii m theo phng php trung bnh tm...........................................................37
Hnh 2.6: Hm thuc hp thnh dng i xng....................................................................37
Hnh 2.7: Gii m trung bnh tm vi m=2..........................................................................38
Hnh 3.1: Phn phi kt hp lut R1(x,y): IF U l Bi THEN V l Di..................................45
Hnh 3.2: Phng php lp lun Mamdani/Constructive......................................................48
Hnh 3.3: Kt qu tnh ton u ra bng hnh phng php Mamdani.................................48
Hnh 3.4: S khi ca phng php lp lun lgic.........................................................52
Hnh 3.5: Tnh ton kt qu u ra bng hnh ca phng php logic.................................52
Hnh 3.6: Biu din cc quan h m R tng ng vi phng php Mamdani...................53
Hnh 3.7: S khi ca c ch suy din n gin.............................................................55
Hnh 3.8: Biu din hnh hc ca h suy din v d 2.......................................................59
Hnh 4.1: Ca s son tho phn lp M- Neuron thch nghi ............................................62
Hnh 4.2: H thng suy din M c thit k bng Simulink............................................63
Hnh 4.3: M hnh cu trc GUI trong Matlab.....................................................................65
Hnh 4.4: Cu trc FIS..........................................................................................................66
Hnh 4.5: Hm thuc bin m ca bin vo Arrival.............................................................70
Hnh 4.6: Hm thuc bin m ca bin vo Queue .............................................................70
Hnh 4.7: Hm thuc bin m ca bin ra Extention............................................................70
Hnh 4.8: Biu din hnh hc ca h suy din dng Mamdani.............................................74
Hnh 4.9: Biu din hnh hc ca h suy din dng lp lun logic.......................................74

M U
T nhng nm u ca thp k 90 cho n nay, h iu khin m v mng
nron (Fuzzy system and neuron network) c cc nh khoa hc, cc k s v
sinh vin trong mi lnh vc khoa hc k thut c bit quan tm nghin cu v
ng dng vo sn xut. Tp m v logic m (Fuzzy set and Fuzzy logic) da trn
cc suy lun ca con ngi v cc thng tin khng chnh xc hoc khng y
v h thng hiu bit v iu khin h thng mt cch chnh xc. iu khin
m chnh l bt chc cch x l thng tin v iu khin ca con ngi i vi cc
i tng, do vy, iu khin m gii quyt thnh cng cc vn iu khin
phc tp trc y cha gii quyt c.
Hin nay, c th ni, cng ngh tnh ton m l mt trong nhng lnh vc
nghin cu pht trin mnh m nht, c nh du bng s ra i ca hng lot
phng php k thut ng dng trong nhiu lnh vc khc nhau. Vic tch hp cc
k thut logic m vi cc phng php phn tch khc ngy cng din ra mnh m.
Logic m c ng dng rng ri gii quyt rt nhiu bi ton ca khoa hc ng
dng. Nhng lnh vc c th k ra y l vn tr hc, h tr quyt nh, iu
khin, nhn dng mu, kinh t, qun l, x hi hc, m hnh thng k, my hc,
thit k c kh, ch to, phn lp, suy lun, thu nhn thng tin, qun l c s d
liu, chun on y t, h c s tri thc,
c bit trong lnh vc x l tri thc, cng ngh tnh ton m t ra v cng
hiu qu. Do tri thc con ngi thng c biu din bng cc th hin ngn ng,
bng cc cu hi, cc pht biu v th gii ang xt. Vn i vi vic x l tri
thc l khng ch vic lin kt cc tri thc, cc pht biu v th gii ang xt, m
cn vic nh gi s ng n ca chng. Logic hnh thc c in cho php
chng ta nh gi mt pht biu v th gii l hoc ng, hoc sai. Tuy nhin,
trong thc t, nh gi mt pht biu ch c ng hoc sai l rt kh nu khng
mun ni l phi thc t. Ly v d: i vi cc tri thc dng p sut cao, Th
tch nh, Qu to , vic xc nh mt cch chnh xc tr chn l ca chng l
ng hay sai l rt kh do cc t cao, nh hay hon ton c tnh cht m
h. T Zadeh m rng logic mnh thnh logic m, trong , mi mnh
P s c gn cho 1 tr chn l (P), mt gi tr trong on [0, 1], biu din mc
ng n ca mnh .

Lun vn vi mc tiu chnh l tm hiu cc quy trnh suy din m s tp

trung vo cc ni dung nh sau:
Chng I tm hiu v c s ca logic m, nhc li cc khi nim, nh ngha
c bn ca cc ton t trong logic m nh t-chun, t-i chun, php ph nh,
php ko theo, hm thuc, php hp thnh
Chng II ca lun vn tm hiu v khi nim, nh ngha ca lut m v h
m trn c s cc lut m. Gii thiu kin thc c bn v kin trc, cc bc suy
din ca h suy din m v tm hiu mt s phng php suy din trong h m.
Chng III i su vo nghin cu k hn v cc phng php lp lp xp x
trong h m. Tm hiu li cc m hnh ngn ng, m hnh Mamdani v c bit l
m hnh Takagi Sugeno Kang vi u ra ca h suy din khng phi l bin m
n m l mt hm u ra.
Chng IV gii thiu li b cng c logic m ca phn mm Matlab b
cng c vi y cc tnh nng thit k v xy dng cc h suy din m rt
hu ch. ng thi gii thiu bi ton thit k h suy din iu khin tn hiu n
giao thng, s dng ci t th kt qu cho cc thut ton gii thiu trong
chng III ca lun vn.

CHNG I - C S LOGIC M
c th tin hnh cc php ton logic trn cc mnh , chng ta cn phi
c cc php ton logic m. chnh l cc php ton ph nh, t - chun tng ng
vi php hi, t - i chun ng vi php tuyn, v php ko theo m.
Trong chng ny, chng ta s nhc li cc khi nim v c s logic m v
tm hiu h suy din m. Do gii hn ca lun vn nn c nhiu khi nim, chng
minh s khng c trnh by ht trong ni dung bi vit. Kin thc c s ca logic
m c th c xem thm cc ti liu [1, 2, 3, 5, 6, 8, 9, 18]. Trc ht, chng ta
bt u bng vic tm hiu v cc ton t m v mt s tnh cht c trng ca
chng.

1.1. Logic r v s xut hin ca logic m

Logic r (logic thng thng) ta qu quen thuc hng ngy vi nhng
khi nim rt r rng v t cho ta cc kt lun dt khot [9].
Chng hn mt c quan cn tuyn dng ngi lm vic, trong cc tiu chun
tuyn chn c mt tiu chun nh sau:
Nu ngi cao t 1,6m tr ln th thuc loi ngi cao v c chp nhn,
cn di 1,6m th thuc loi ngi thp v b loi.
Nh vy nu c mt ngi no c tt c cc tiu
chun khc nhng ch cao 1,59m th s b loi. Logic
suy ngh rt r rng theo s my tnh nh sau:
1.6
m
Nh vy, im 1,6m l im ti hn ra quyt
nh, c 1,6m tr ln l thuc loi ngi cao, cn di
Loi
1,6m l loi ngi thp.

Nhn

Nhng suy ngh v logic m (logic khng r):

trong cuc sng hng ngy, c bit l rt nhiu hin tng (nu khng ni l tt
c) c th hin bng ngn ng a ta n mt khi nim logi khng r, logic
m, chng hn:
Anh ny trng rt cao.
C ny trng c y.

Hay nh c nh th vit:
Tri th khng nng khng ma,
Ch hiu hiu mt cho va lng nhau.
Cc khi nim nh: trng rt cao, c y, khng nng khng ma, hiu hiu
mt, tht kh cho ta a ra mt con s c th. Tuy vy khi nghe cc t ny ta
vn hnh dung c mt c tnh c th r rt v i tng.
Nhng suy ngh ny a n khi nim v logic m, chnh logic m xa
i c khi nim cng nhc ca logic r, v rng logic m :
- Cho php m t cc trng thi s vic khi s dng cc mc thay i gia
ng v sai.
- C kh nng lng ha cc hin tng nhp nhng hoc l thng tin hiu
bit v cc i tng khng hoc khng chnh xc.
- Cho php phn loi cc lp quan nim chn lp ln nhau.

1.2. Cc php ton v tp m

1.2.1. Php ph nh
* nh ngha 1.1: Hm n: [0, 1] [0, 1] khng tng tha mn cc iu kin n(0) =
1, n(1) = 0 gi l hm ph nh (negation-hay l php ph nh).
* nh ngha 1.2:
a) Hm ph nh n l cht nu n l hm lin tc v gim cht.
b) Hm ph nh n l mnh nu n l cht v tha mn n(n(x)) = x,
x[0,1]
* V d 1:
- Hm ph nh thng dng n(x) = 1-x. y l hm ph nh mnh
- Hm n(x) = 1-x2. y l mt ph nh cht nhng khng mnh.
- H ph nh (Sugeno) N ( x) =
mnh sau:

1 x
, > 1 . Vi h Sugeno ny ta c
1+ x

* Mnh 1.3: Vi mi > 1 , N ( x) l mt ph nh mnh.

* Chng minh:
Tht vy, do 1 +>0 vi x1 < x2 , x1 + x1 < x2 + x2 . iu ny tng ng
vi N ( x1 ) > N ( x2 ) .
Hn na, N ( N ( x)) =

(1 + x) (1 x )
= x vi mi 0 x 1 .
(1 + x) + (1 x)

thun li ta cn thm nh ngha sau:

Mt cch nh ngha phn b ca mt tp m: Cho l khng gian nn, mt
tp m A trn tng ng vi hm thuc A: [0,1].
* nh ngha 1.4: Cho n l hm ph nh, phn b AC ca tp m A l mt tp m
vi hm thuc cho bi AC (a ) = n( A(a)) , vi mi a.
R rng nh ngha phn b cho trong phn 1.1 l trng hp ring khi n(x)
l hm ph nh thng dng.

1.2.2. T - chun
1.2.2.1. Php hi
Php hi (vn quen gi l php AND - Conjunction) l mt trong my php
ton logic c bn nht, n cng l c s nh ngha php giao ca hai tp m.
Php hi cn tho mn mn cc tin sau:
C0: v(P1 AND P2) ch ph thuc vo v(P1) v v(P2).
C1: Nu v(P1) =1 th v(P1 AND P2) = v(P2) vi mi mnh P2.
C2: Giao hon v(P1 AND P2) =v(P2 AND P1).
C3: v(P1) v(P2) th v(P1 AND P3) v(P2 AND P3), vi mi mnh P3.
C4: Kt hp: v(P1 AND (P1 AND P3)) = v((P2 AND P2) AND P3).
Nu din t php hi m (fuzzy conjunction) nh mt hm T: [ 0, 1]
[ 0, 1] , th chng ta c th cn ti hm sau:
* nh ngha 1.5:

Hm T: [ 0, 1]
cc iu kin sau:

[ 0, 1] l mt t - chun (t-norm), khi v ch khi tho

C5: T(1, x) = x vi x [0, 1].

C6: T c tnh giao hon, tc l T(x, y) = T(y, x), vi x, y [0, 1]
C7: T khng gim theo ngha T(x, y) T(u, v), vi x u, y v
C8: T c tnh kt hp, tc lT(x, T(y, z)) = T(T(x, y), z), vi 0 x, y, z
1.
T cc tin trn chng ta suy ra ngay T(0, x) = 0. Hn na, tin C8
m bo tnh thc trin duy nht cho hm nhiu bin.
1.2.2.2 Mt s t - chun thng dng
1) T - chun yu nht (drastic product)
min{x, y} khi max{x, y} = 1
Z(x, y) = T0(x, y) =

khi max{x, y} < 1

0
2) T - chun LukasiewiczTL (x, y) = max(0, x+y-1)
3) T2(x, y)=

xy
2 ( x + y xy )

4) Dng tch TP (x, y) = x.y

5) T4(x, y) =

xy
x + y xy

6) Dng min (Zadeh, 1965) TM(x, y) = min(x, y)

7) Dng Min Nilpotent (Fordor)
min{x, y} khi x + y > 1
TN(x, y) = min0(x, y) =

khi x + y 1
0
* nh l 1.6:
Vi T l mt t - chun bt k th bt ng thc sau lun ng vi mi x, y
[0, 1]
T0(x, y) T(x, y) TM(x, y)

T0 TL T2 TP T4 TN TM
Phn chng minh cc nh l xem trong ti liu dn [7]
* nh ngha 1.7: Cho T l t - chun. Khi y
a) T gi l lin tc nu T l hm lin tc trn [0, 1]2.
b) T l Archimed nu T(x, x) < x, vi x (0, 1).
c) T gi l cht nu T l hm tng cht trn [0, 1]2.
* V d:
1) T2 (x, y) =

xy
l Archimed v: T2(a, a) = a2/(2 - (2a - a2)).
2 ( x + y xy )

a2
Do a2 - 2a + 2 = (a - 1)2 + 1 > 1
< a2 a
2 (2a a 2 )
Vy T2(a, a) < a, vi a (0, 1).
2) TP(x, y) = xy l cht v 0 x1 < x2, 0 y1 < y2, ta c x1y1 < x2y2.
3) TM(x, y) = min(x, y) l mt hm lin tc trn [0, 1]2, nn t - chun T l
lin tc. Hn th na, ta lun c TM(x, x) = min(x, x) = x.
1.2.2.3 th ca mt s hm t - chun:

min{x, y} khi max{x, y} = 1

T0(x, y)=

khi max{x, y} < 1

0
Hnh 1.2: th t-chun yu nht T0
TL(x, y) = max(0, x+y-1)

Hnh 1.2: th t-chun Lukasiewiez

T2(x, y) =

xy
.
2 ( x + y xy )

Hnh 1.3: th t-chun T2

TP(x, y) = xy

Hnh 1.4: th t-chun t(x,y) = x*y

TM(x, y) = min(x, y)

Hnh 1.5: th t-chun min

min{x, y} khi x + y > 1

TN(x, y)=

khi x + y 1
0
Hnh 1.5: th t-chun Min-Nilpotent

T4(x, y) =

xy
x + y xy

Hnh 1.6: th t-chun T4

1.2.2.4. nh ngha tng qut php giao ca 2 tp m.
Cho hai tp m A, B trn cng khng gian nn vi hm thuc tng ng
l A(x), B(x). Cho T l mt t - chun.
* nh ngha 1.8:
ng vi t - chun T, tp giao ca hai tp m A, B l mt tp m (ATB)
trn X vi hm thuc cho bi: (ATB)(x) = T(A(x), B(x)), vi xX
Vic la chn php giao, tng ng vi t - chun T no tu thuc vo bi
ton c quan tm.
* V d: Hamacher(1978) ngh dng
( A p B )(a ) =

A(a).B (a )
p + (1 p)( A(a) + B (a ) A(a ).B( a))

vi p 0, vi mi a ,
cn Yager (1980) xt php giao hai tp m A, B vi hm thuc cho bi
(A p B)(a)= 1 - min{ 1, ((1- A(a))p +(1- B(a))p) 1/p }, p 1, vi mi a [0, 1].

10

Cng thi, Dubois v Prade cng ngh mt h ton t ph thuc tham s t,

l php giao (A tB) vi hm thuc
(At B)(a)=A(a).B(a)/ max{ A(a), B(a), t }, vi 0 t 1, vi mi a[0, 1].
* V d: Cho U l khng gian nn: U = [0, 120] - thi gian sng;
A = { Nhng ngi tui trung nin} ;
B = { Nhng ngi tui thanh nin}
Khi giao ca hai tp m A v B vi T(x, y) = min(x, y) v T(x, y) = xy
chng c biu din trn hnh v nh sau:

Hnh 1.7: Giao ca 2 tp m dng tch

Hnh 1.8: Giao ca 2 tp m dng min

1.2.3. T - i chun
1.2.3.1. Php tuyn
Ging nh php hi, php tuyn hay ton t logic OR thng thng cn tha
mn cc tin sau:
D0: v(P1 OR P2), ch ph thuc vo v(P1) v v(P2).
D1: Nu v(P1) = 0, th v(P1 OR P2) = v(P2), vi mi mnh P2.
D2: Giao hon v(P1 OR P2) = v(P2 OR P1).

11

D3: Nu v(P1) v(P2), th v(P1 OR P3) v(P2 OR P3), vi bt k P3.

D4: Kt hp v(P1 OR(P2 OR P3)) = v((P1 OR P2) OR P3).
Khi y ta c th ngh ti cc php tuyn c nh ngha bng con ng
tin nh sau:
* nh ngha 1.9:
Hm S: [0, 1]2 [0, 1] gi l mt hm tuyn (OR suy rng) hay l t - i
chun (t-conorm) nu n tha mn cc tin sau:
D5: S(0, x) = x, vi x [0, 1].
D6: S c tnh cht giao hon: S(x, y) = S(y, x), vi x, y [0, 1].
D7: S khng gim: S(x, y) S(u, v) vi 0 x u 1; 0 y v 1.
D8: S c tnh kt hp: S(x, S(y, z)) = S(S(x, y), z), vi x, y [0, 1].
T nh ngha ta thy: S(0, 1) S(x, 1) 1 S(x, 1) 1 S(x, 1) = 1.
1.2.3.2. Mt s hm t - i chun thng dng
Chn php ph nh n(x) = 1- x ta c cc hm t - i chun thng dng nh
sau:
1) SM(x, y) = max (x, y).
2) SP(x, y) = x + y - xy.
3) S2(x, y) =

x + y 2 xy
.
1 xy

4) S4(x, y) =

x+ y
.
1 + xy

5) SL(x, y) = min(1, x+y).

max{x, y} khi (x + y ) < 1
6) SN(x, y) = max1(x, y) =

khi (x + y ) 1
0
max{x, y} khi min(x, y ) = 0
7) S0(x, y) =

khi min(x, y ) > 0

0
* nh l 1.10:

12

Vi S l mt t - i chun bt k th bt ng thc sau lun ng vi mi x,

y [0, 1].
a) SM(x, y) S(x, y) S0(x, y).
b) SM SP S2 SL S4 S0
c) SM S2 SL S4 SN S0
Phn chng minh cc nh l xem trong ti liu dn [2, 6]
* Ch : SP v SN khng so snh c vi nhau, bi v khi x + y 1 ta c:
SN(x, y) = max(x, y) x + y - xy = SP(x, y).
Khi x + y > 1 ta c: SN(x, y) =1 > x + y - xy = SP(x, y).
* nh ngha 1.11:
Cho S l t - i chun. Khi y:
S gi l lin tc nu S l hm lin tc trn [0, 1]2.
Hm S gi l Archimed nu S(x, x) > x vi 0 < x < 1.
S gi l cht nu S l hm tng trn [0, 1]2
* V d:
- SP(x, y) = x + y - xy, l cht v: Gi s x1 < x2, ta c SP(x1, y) = x1 + y - x1y
< x2 + y - x2y = SP(x2, y), vi y(0, 1). Mt khc do S c tnh cht giao hon nn
ta c SP(x1, y1) < SP(x2, y2), vi mi 0 < x1 < x2 < 1; 0< y1 < y2 < 1.
- SM(x, y) = max(x, y) l mt hm lin tc trn [0, 1] 2, nn t - i chun S l
lin tc. Hn th na, ta lun c SM(x, x) = max(x, x) = x.
- SL(x, y) = min{1, x + y} l Archimed v
SL(x, x) = min(1, x + x) = min(1, 2x) > x
1.2.3.3. th ca mt s hm t - i chun

13

max{x, y} khi (x + y ) < 1

SN(x, y)=

khi (x + y ) 1
0

Hnh 1.8: th hm t-i chun SN

SM(x, y) = max (x, y)

Hnh 1.9: th T-i chun SM

SP(x, y) = x + y xy

Hnh 1.10: th T-i chun SP

S2(x, y)=

x + y 2 xy
1 xy

14

Hnh 1.11: th T-i chun S2

S4(x, y) =

x+ y
1 + xy

Hnh 1.13: th T-i chun S4

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

Hnh 1.14: th T-i chun SL

max{x, y} khi min(x, y ) = 0

S0(x, y)=

khi min(x, y ) > 0

0

Hnh 1.15: th T-i chun S0

1.2.3.4. nh ngha tng qut php hp ca 2 tp m
* nh ngha 1.12:
Cho A v B l 2 tp m trn khng gian nn , vi hm thuc A(x), B(x)
tng ng. Cho S l mt t - i chun. Php hp (ASB) l mt tp m trn X vi
hm thuc cho bi biu thc:

15

(ASB)(x) = S(A(x), B(x)), vi x X.

Vic la chn php hp, tng ng vi t - i chun S no tu thuc vo bi
ton ta quan tm.
* V d:
Hamacher, 1978, cho h php hp hai tp m vi hm thuc theo tham s
q,
( A q B)( a) =

( q ) A( a).B (a) + A(a ) + B (a )

vi q -1, a
1 + a ( A(a ).B( a)

Cn h php hp (Ap B) tng ng ca Yager cho bi hm thuc vi tham

s p,
(A p B)(a)=min {1, (A(a)p+ B(a)p) 1/p}, vi p 1, a .
Tng t, h php hp do Dubois v Prade ngh vi cc hm thuc vi
tham s t, c dng:
( A t B )( a) =

A(a) + B (a) A(a).B (a ) min{ A(a ), B( a), (1 t )}

max{(1 A( a)), (1 B (a )), t}

vi t [0, 1], a.
* V d: Cho U l khng gian nn: U = [0, 120] l thi gian sng.
A={Nhng ngi tui trung nin}; B ={Nhng ngi tui thanh nin}.
Khi hp ca hai tp m A, B vi T(x, y) = max(x, y) v T(x, y)= max(1,
x+y). Biu din trn hnh v nh sau:

Hnh 1.16: Hp ca hai tp m dng Max

16

Hnh 1.17: Hp ca hai tp m dng Lukasewiez

1.3. Mt s vn lin quan ca cc ton t trong Logic M

1.3.1. Php i ngu
Trong logic c in, ta c th a cng thc ca logic mnh v dng ch
cha cc php ton , , . Trong logic m cng vy, ta c th a cc cng thc
v dng ch cha: n, S, T.
* nh ngha 1.13:
Gi s N(P, Q, R,...) l cc cng thc ch cha cc php ton n, S, T. Nu
trong N(P, Q, R,...), ta thay S, T tng ng bi T, S th cng thc mi nhn c
sau php thay th gi l cng thc i ngu ca cng thc N(P, Q, R,...). K hiu
bi N*(P, Q, R,...). Php bin i t cng thc N thnh cng thc N* gi l php
i ngu.
* V d:
- Cng thc i ngu ca S(x, y) l T(x, y).
- Cng thc i ngu ca cng thc n(S(T(x, y))) l n(T(S(x, y))).

1.3.2. Quan h gia t - chun v t - i chun.

Gia t - chun v t - i chun ta c th biu din thng qua nhau theo nh
l sau:
* nh l 1.14: Cho n l php ph nh mnh, S l mt t - i chun. Khi hm T
xc nh trn [0, 1]2 bng biu thc:
T(x, y) = n(S(n(x), n(y))), vi 0 x, y 1 l mt t - chun.

17

Tng t, chng ta c nh l sau:

* nh l 1.15: Cho n l php ph nh mnh, T l mt t- chun, khi y hm S xc
nh trn [0, 1]2 bng biu thc:
S(x, y) = n(T(n(x), n(y))), vi 0 x, y 1l mt t - i chun.
Dng hai nh l trn chng ta c th chn nhiu cp (t - chun, t - i chun)
i ngu tng ng.
Sau y l my cp i ngu:
Chn n(x) = 1 - x, chng ta c:
T(x, y)

S(x, y)

min(x, y)

max(x, y)

x.y

x + y - x.y

max{ x + y - 1, 0}

min{ x + y, 1}

min0(x, y)=
min{x, y} v i (x + y ) > 1

v i (x + y ) 1
0

max1(x, y) =
max{x, y} v i (x + y ) < 1

v i (x + y ) 1
0

Z(x, y) =
min{x, y} v i max(x, y ) = 1

v i max(x, y ) < 1
0

Z(x, y) =
max{x, y} v i min(x, y ) = 0

v i min(x, y ) > 0
0

Bng 1.1 : Cc cp i ngu vi n(x) = 1-x

1.3.3. Mt s qui tc vi php hi v php tuyn

Trong l thuyt tp m v suy lun vi logic m, mt s tnh cht trong l
thuyt tp hp theo ngha thng thng khng cn ng na. Chng hn trong l
thuyt tp hp, vi bt k tp r A X, th ta c:
A AC = ;A AC = X.
Nhng sang tp m th hai tnh cht trn khng cn ng na.

18

Cho T l t - chun, S l t - i chun, n l php ph nh. Ta c mt s tnh

cht sau:
- Tnh lu ng (idempotency):
* nh ngha 1.16:
Chng ta ni T l lu ng (idempotency) nu T(x, x) = x, vi x [ 0,
1] , v S l lu ng nu S(x, x) = x, vi x [ 0, 1] .
* Mnh 1.17:
T l lu ng khi v ch khi T(x, y) = min(x, y), vix, y [ 0, 1] , v cng
ni S l lu ng khi v ch khi S(x, y) = max(x, y), vi x, y [ 0, 1] .
- Tnh nut (absorption):
* nh ngha 1.18:
C hai dng nh ngha nut suy rng t l thuyt tp hp:
T(S(x, y), x) = x, vi x, y [ 0, 1] .

(a)

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

(b)

* Mnh 1.19:
(a) ng khi v ch khi T(x, y) = min(x, y), vi x, y [ 0, 1] ,
(b) ng khi v ch khi S(x, y) = max(x, y), vi x, y [ 0, 1] .
- Tnh phn phi (distributivity):
* nh ngha 1.20:
C hai biu thc xc nh tnh phn phi:
S(x, T(y, z)) = T(S(x, y), S(x, z)), vi x, y, z [ 0, 1] .

(c)

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

(d)

* Mnh 1.21:
(c) ng khi v ch khi T(x, y) = min(x, y), vi x, y [ 0, 1] ,
(d) ng khi v ch khi S(x, y) = max(x, y), vi x, y [ 0, 1] .
- Lut De Morgan.

19

Lut De Morgan trong l thuyt tp hp:

(A B)C = A C B C
(A B) C = A C B C
Trong logic m lut De Morgan c suy rng:
* nh ngha 1.22:
Cho T l t - chun, S l t - i chun, n l php ph nh cht. Ta ni b ba
(T, S, n) l mt b ba De Morgan nu: n(S(x, y)) = T(n(x), ny).
Ta ni b ba l lin tc nu S, T l hai hm lin tc.

1.4. Php ko theo

1.4.1. nh ngha php ko theo
Cho n by gi c kh nhiu nghin cu v php ko theo (implication).
iu cng t nhin v y l cng on cht nht ca qu trnh suy din trong
mi lp lun xp x, bao gm c suy lun m.
Php ko theo c xt nh mt mi quan h, mt ton t logic. Cc tin
cho hm v(P1 P2):
I0: v(P1 P2) ch ph thuc vo gi tr v(P1), v(P2).
I1: Nu v(P1) v(P3) th v(P1 P2) v(P3 P2), vi mi mnh P2.
I2: Nu v(P2) v(P3) th v(P1 P2) v(P1 P3), vi mi mnh P1.
I3: Nu v(P1) = 0 th v(P1 P) = 1, vi mi mnh P.
I4: Nu v(P1) = 1 th v(P P1) = 1, vi mi mnh P.
I5: Nu v(P1) = 1 v v(P2) = 0 th v(P P1) = 0.
Tnh hp l ca cc tin ny ch yu da vo logic c in v nhng t
duy trc tip v php suy din. T tin I0 ta khng nh s tn ti ca hm I(x,
y) xc nh trn [0, 1]2, vi gi tr chn l qua biu thc sau:
v(P1 P2) = I(v(P1), v(P2)).
* nh ngha 1.23:

20

Php ko theo l mt hm s I: [ 0, 1]

[0, 1], tho mn cc iu kin

sau:
I6: Nu x z th I(x, y) I(z, y), vi y [0, 1].
I7: Nu y u th I(x, y) I(x, u), vi x [0, 1].
I8: I(0, x) =1, vi x [0, 1].
I9: I(x, 1) =1, vi x [0, 1].
I10: I(1, 0) = 0.
Tip tc, chng ta xem xt thm mt s tnh cht khc ca php ko theo,
nhng tnh cht ny nhn c nh nhng bi bo ca Dubois v Prade:
I11: I(1, x) = x, vi x [0, 1].
I12: I(x, I(y, z)) = I(y, I(x, z)).
y l qui tc i ch, c s trn s tng ng gia hai mnh if P 1
then (if P2 then P3) v if P2 then (if P1 then P3).
I13: x y nu v ch nu I(x, y) =1 (php ko theo xc lp mt th t).
I14: I(x, 0) = N(x). (l mt php ph nh mnh).
Nh vy I14 phn nh mnh sau t logic c in (P Q) = P, nu v(Q)
= 0 (nu Q l sai).
I15: I(x, y) y vi x, y.
I16: I(x, x) = 1, vi x.
I17: I(x, y) = I(N(y), N(x)). iu kin ny phn nh php suy lun ngc
trong logic c in hai gi tr: (P Q) = ( Q P). y l iu kin mnh.
I18: I(x, y), l hm lin tc trn [0, 1].
tm hiu thm cc iu kin ny ngi ta a ra nh l sau:
* nh l 1.24:
Mi hm s I: [ 0, 1] 2 [ 0, 1] tho mn cc iu kin I7, I12, I13, th
hm I s tho mn cc iu kin I6, I8, I9, I10, I11, I15, I16.

21

1.4.2. Mt s dng hm ko theo c th

Cho T l t - chun, S l t - i chun, n l php ph nh mnh
1.4.2.1. S - Implication
* nh ngha 1.25: Hm IS(x, y) xc nh trn [0, 1]2 bng biu thc:
IS(x, y) = S(n(x), y)
R rng n sau nh ngha ny l cng thc t logic c in
(PQ) ( PQ)
* nh l 1.26:
Vi bt k t - i chun S v php ph nh mnh n no, IS c nh ngha
nh trn l mt php ko theo.
* Chng minh: (Ta kim chng IS tng tin ca nh ngha 1.23).
a) Tin I6: Cho x z. V IS(x, y) = S(n(x), y). Ta ch xt trng hp x < z,
khi y n(x) > n(z). Do t - i chun khng gim theo hai bin
IS(x, y) = S(n(x), y) S(n(z), y) = IS(z, y).
b) Tin I7: Cho y t, khi IS(x, y) = S(n(x), y) S(n(x), t) = IS(x, t), vi

x
c) Tin I8: IS(0, x) = S(n(0), x) = S(1, x) max(1, x) =1, vy IS(0, x) =1,
vi x
d) Tin I9: IS(x, 1) = S(n(x), 1) max(n(x), 1) =1, vy IS(x, 1) =1, vi x.
e) Tin I10: IS(1, 0) = S(n(1), 0) = S(0, 0) = 0, vy IS(1, 0) = 0,
IS l mt php ko theo ca logic m tho mn nh ngha 1.23.
1.4.2.2. R - Implication
* nh ngha 1.27: Cho T l mt t - chun, hm IT(x, y) xc nh trn [0, 1]2 bng
biu thc:
IT(x, y) = sup{ u:T(x, u) y }
* nh l 1.28:

22

Vi bt k t - chun T no, IT c nh ngha nh trn l mt php ko

theo.
* Chng minh: (ta kim chng IT tng tin ca nh ngha 1.23)
a) Tin I6: Cho x z. V IT(x, y) = sup{u: T(x, u) y}. Do t - chun T
khng gim theo hai bin, nn T(x, u) T(z, u) v do vy:
{u: T(z, u) y} {u: T(x, u) y}.
sup{u: T(z, u) y} sup{u: T(x, u) y}.
Hay IT(z, y) IT(x, y), vi mi y. chnh l iu kin I6.
b) Tin I7: cho y t, khi vi mi cp (x, u) ta c T(x, u) y t.
{u: T(x, u) y} {u: T(x, u) t}.
sup{u: T(x, u) y} sup{u: T(x, u) t}.
Hay IT(x, y) IT(x, t), vi mi x. chnh l iu kin I7.
c) Tin I8: T(0, x) = x vi bt k u no ta c 0 u 1. Do vy T(0, u)
x, suy ra sup{u: T(0, u) x} = 1, vi x. Hay IT(0, x) = 1. chnh l iu kin I8.
d) Tin I9: IT(x, 1) = 1 l hin nhin vi x.
e) Tin I10: Do IT(1, 0) = sup{u: T(1, u) 0}, iu ny dn ti T(1, u) = 0.
S dng tnh cht T(1, u) = u ca t - chun, ch c u = 0 tho mn ng thc, tc l
T(1, 0) = 0. Vy I10 tho mn.
Vy IT l mt php ko theo ca logic m tho mn nh ngha 1.23.
Nh nhn xt t u, c rt nhiu con ng mun xc nh php ko
theo. Php ko theo sau y, ni chung khng tho mn tin 1, nhng c
nhiu tc gi s dng, chnh ca php ko theo ny bt ngun t biu din php P
Q theo l thuyt tp hp.
Nu P, Q biu din di dng tp hp trong cng mt khng gian nn th (P
Q) = ( P (P Q)).
S dng T l t - chun, S l t - i chun, n l php ph nh, th c th ngh
ti dng: I(x, y) = S (T(x, y), n(x))

23

Lp lun tng t khi cho P v Q trn cc khng gian nn khc nhau cng c
th dn ti cng dng hm I(x, y) ny.
1.4.2.3. QL - Implication
Nh nhn xt t u, c rt nhiu con ng mun xc nh php ko
theo. Php ko theo sau y ni chung khng tha mn tin th nht nhng
c nhiu tc gi s dng, chnh ca php ko theo ny bt ngun t biu din
php P Q theo l thuyt tp hp.
Nu P, Q l cc mnh trong logic c in hay ta biu din di dng tp
hp trong cng mt khng gian nn th (PQ) = (P(PQ).
S dng T l t - chun, S l t - i chun, n l php ph nh, th c th ngh
ti dng: I(x, y)=S(T(x, y), n(x))
* nh ngha 1.29: Cho (T, S, n) l mt b ba De Morgan vi n l php ph nh
mnh, php ko theo th ba IQL(x, y) (t Logic lng t - Quantum Logic) xc nh
trn [0, 1]2 bng biu thc:
IQL(x, y)=S(T(x, y), n(x)), 0 x, y 1 .
* V d: Chn T(x, y)= xy, S(x, y) = x+y-xy, ta c:
IQL(x, y) = S(xy, (1-x)) = xy+(1-x)-xy(1-x).
T IQL(x, y) = 1-x+x2y. Ta c hnh v sau:

Hnh 1.18: th IQL= 1-x+x2y

Chn n(x)-1-n, T ( x, y ) = max { x + y 1,0} ; S ( x, y ) = min { x + y, 1} c:

24

I QL ( x, y ) = S { max ( x + y 1, 0 ) , 1 x}
= min { max ( x + y 1, 0 ) + ( 1 x ) ,1}
= min { max ( y, 1 x ) , 1}
Do

y 1

nn

lun

max( y,1- x) 1 .

c:

Khi

I QL ( x, y ) = max ( y, 1 x ) . Hnh v nh sau:

0.5

1
0.8

0
0

0.6
0.4

0.2
0.4

0.2

0.6
0.8
1

Hnh 1.19: th IQL= max(y,1-x)

Chn T(x, y)=Z(x, y), S(x, y)=Z(x, y). Xt ln lt cc trng hp:
+ Nu max( x, y ) 1 th ta c T(x, y) = Z(x, y) = 0, khi :
I QL ( x, y ) = S ( T ( x, y ) , n ( x ) )
= Z ( 0,1 x )
= max(0,1 x) =1 x

do min(0, 1-x)=0)

+ Nu x = 1, ta c T(x, y) = Z(1, y) = min(1, y) = y, khi

IQL(x, y) = S(T(x, y), n(x)) = Z(y, 1-1) = Z(y, 0) = y
+ Nu y =1; x < 1 ta c: T(x, y) = Z(x, 1) = min(x, 1) = x, khi
IQL(x, y) = S(T(x, y), n(x)) = Z(1, 1-x) = Z(y, 0) = y= 1
(v x <1 nn min(1, 1-x) =1-x >0)
Tm li ta c:
y nu x = 1

I QL ( x, y ) = 1 nu y = 1
1 x khc i

1.4.2.4. A-implication

ta

25

C nhiu ton t ko theo m c a ra. Hu ht chng u thuc vo

mt trong hai loi: cc php ton ko theo c da trn biu din r ca php ko
theo A B di dng &, , (V d: S- ko theo c biu din bng cng thc
B A ), v R - ko theo da trn mt biu din n ca ko theo A B. Tuy nhin
mt vi ton t ko theo m (nh ba) khng c biu din mt cch t nhin di
dng ny. miu t thao tc ny, ta a ra mt lp mi (lp th ba) ca ton t
ko theo gi l A-implication c mi lin quan vi &, , c miu t bi mt
tin ca Elsevier.
Xt ton t ko theo f (a, b) = b a v f (0, 0) = 1 xut hin i vi ton t &
n gin nht ( f & (a, b) = a.b ) nu thm vo S- v R- ko theo. Ta a ra mt loi
mi ca ton t ko theo m ta gi l A- ko theo bi chng c xc nh duy
nht bng mt s tin ph hp. Ta m t tin ny nh sau:
* Cc tin : Trong phn ny, ta gi s rng c hai hm c a ra:

f : [0, 1][0, 1] [0, 1] v f : [0, 1] [0, 1].

+) (I0): Vi mi a, b {0, 1}, php c ph hp vi php ko theo c
in. V d: a b =1 tr khi a =1, b = 0, trong cc trng hp khc th a b = 0
* nh ngha 1.30: Ta ni hm f : [0, 1][0, 1] [0, 1] tha mn tin (I0) nu

f (0, 0) = f (0, 1) = f (1, 1) = 1 v f (1, 0) =0.

+) (I1): a (b&c) (ab) & (ac)
* nh ngha 1.31: Ta ni rng hm f : [0, 1]x[0, 1] [0, 1] tha mn tin (I1)
nu f (a, f & (b, c)) = f & ( f ( a, b), f ( a, c)) vi mi a, b v c
*Kt qu:
Cho f&(a,b)=a.b; f(a)=1 f & ( a, b) = a.b ;

f (a ) = 1 a.Ta gi s rng mt

f ( a, b) l lin tc ti mi im ca (a, b), c th tr im (0, 0) v im (1, 1).

Khi :
Nu f tha mn (I0) v (I1) th hm f c dng sau:
f (a,b)= bp(a) ; a,b(0,1)

26

* Chng minh:
Trc tin chng ta nhn nhng g ta kt lun t (I0) v (I1). Vi mi a (0,
1), ta biu th f (a, b) bng fa(b). Khi , theo (I1) th hm fa tha mn tnh cht
fa(b.c) = fa(b) fa(c). V f lin tc, hm fa cng lin tc do kt qu ca cc hm
ny l:
Hoc fa(b)= 0
Hoc fa(b) = bp(a) vi p ph thuc vo a.
Chng ta ch ra rng trng hp fa(b) =f (a, b) = 0 vi mi a, b (0, 1) l
khng th xy ra.
Tht vy, trong trng hp ny t gi thit tnh lin tc ca hm f ta nhn
f ( ,1 ) =lim 0 = 0. Tri vi (I0)
c f (0, 1)= lim
s 0
Vy f (a, b) = b p ( a ) vi p(a).
T b < 1 v f (a, b) 1 ta kt lun rng p(a) 0. Do f lin tc, hm p(a)
cng lin tc.
Vy, mt hm f tha mn (I0) v (I1) th n c dng f (a, b) = bp(a) vi mi
a, b (0, 1).

1.4.3. th mt s hm ko theo c quan tm

1) Zadeh: kt qu ca vic dng dng hm IQL vi T= min, S= max
I(x, y) = max(1-x, min(x, y))

Hnh 1.20: th I(x,y)=max(1-x,min(x,y))

27

2) Godeh: Kt qu ca dng php ko theo dng IR vi T = min

1
I(x, y) =
y

nux y
nux > y

Hnh 1.21: th hm I(x,y) - Godeh

3) Goguen: Kt qu dng php ko theo IR vi T(x, y) = x.y
1
I(x, y) =
y

nux y
nux > y

Hnh 1.22: th hm I(x,y) - Goguen

4) Kleen-Dienco: Kt qu dng php ko theo IS vi S(x, y) = max(x, y)
I(x, y) = max (1-x, y)
5) Lukasiewiez: y l kt qu dng php ko theo IS hay IR vi
T = t - chun Lukasiewiez IS(x, y) = max(x+y-1, 0)
S = t - i chun Lukasiewiez IR(x, y) - min (x+y, 1)

1.5. Quan h m v php hp thnh

28

1.5.1. Quan h m
* nh ngha 1.32:
Cho X, Y l hai khng gian nn. R gi l mt quan h m trn X Y nu R
l mt tp m trn X Y, tc l c mt hm thuc R: X Y[0, 1], y R(x, y)
= R(x, y) l thuc (membership degree) ca (x, y) vo quan h R.
* nh ngha 1.33:
Cho R1 v R2 l hai quan h m trn X Y, ta c nh ngha
1) Quan h R1 R2 vi R1R2(x, y) = max {R1(x, y), R2(x, y)}, (x, y)
X Y.
2) Quan h R1R2 vi R1R2(x, y) = min {R1(x, y), R2(x, y)} (x, y)
X Y.
* nh ngha 1.34: Quan h m trn nhng tp m
Cho tp m A vi A(x) trn X, tp m B vi B(y) trn Y.Quan h m trn
cc tp m A v B l quan h m R trn X Y tho mn iu kin:
R(x, y) A(x), yY
R(x, y) B(y), xX.

1.5.2. Php hp thnh

* nh ngha 1.35:
Cho R1 l quan h m trn X Y, R2 l quan h m trn Y Z. Hp thnh
R1R2 ca R1, R2 l quan h m trn X Z.
a. Hp thnh max-min (max-min composition) c xc nh bi
R1oR2(x, z) = maxy{min(R1(x, y), R2(y, z))}, (x, z) X Z.
b. Hp thnh max-prod cho bi
R1oR2(x, z) = maxy{R1(x, y).R2(y, z)}(x, z) X Z.
c. Hp thnh max- c xc nh bi ton t *: [0, 1]2 [0, 1]
R1oR2(x, z) = maxy{R1(x, y) * R2(y, z)}(x, z) X Z.

29

Gi thit (T, S, n) l b ba De Morgan, trong : T l t - chun, S l t - i

chun, n l php ph nh.
* nh ngha 1.36:
Cho R1, R2 l quan h m trn X X, php T- tch hp thnh cho mt quan
h R1T R2 trn X X xc nh bi
R1T R2(x, z) = supyXT(R1(x, y), R2(y, z)).
* nh l 1.37:
Cho R1, R2, R3 l nhng quan h m trn X X, khi :
a) R1T (R2T R3) =(R1T R2)T R3
b) Nu R1 R2 th R1TR3 R2TR3v R3TR1R3TR2.

30

CHNG 2 LUT M V H SUY DIN M

Logic m c gii thiu t 1965 do Lotfi A.Zadeh, Gio s khoa hc my
tnh ca i hc California Berkeley. K t Logic m c nhn mnh nh
l mt k thut mnh dnh cho quy trnh iu khin cng nghip, cng vic gia
nh hay in th gii tr, cc h thng phn tch hoc cc h thng chuyn gia
khc. S pht trin mnh m ca cng ngh ny thc s bt u t Nht Bn v
sau tri rng M v cc nc Chu u. Hu ht cc ng dng ca logic m l
trong lnh vc iu khin.
Logic m c bn l mt logic a gi tr m cho php cc gi tr trung gia
c nh ngha nh gi kiu nh ng/ sai, c/khng, en/trng, Cc khi
nim kiu nh nng hay m hoc kh lnh c th cng thc ha v x l c.
Bng cch ny, mt c gng c thc hin p dng gn hn cch con ngi
suy ngh vo trong lp trnh my tnh (tnh ton mm).
H logic m ch ra tnh m h ca cc bin u vo v u ra bng cch
nh ngha s m v tp m m c th biu din dng bin ngn ng (v d, nh,
trung bnh v ln).

2.1. H m trn c s cc lut m

2.1.1. nh ngha lut m
Mt dng khc ca lut IF - THEN m, c xut bi Takagi v Sugeno
[15,18], c cc tp m tham gia vo ch trong phn gi thit Trong kha cnh ny,
logic m bt chc kh nng quyt nh ca tri thc con ngi tng hp d liu
v tp trung vo thng tin quyt nh c lin quan [16,18].
Lut m tip cn m hnh ha c da vo cc cng thc lut bng li
ln nhau thng qua khng gian tham s. Chng s dng php ni suy s hc
qun l cc mi quan h phi tuyn phc tp.
Cho Ui , i = 1.. n l khng gian nn ca bin vo xi, i = 1.. n. Gi
F(Ui) l b cc tp m trn Ui
F(Ui) ={Ai(ui), - tp m trn Ui}

31

trn V

Cho V l khng gian nn ca bin ra y. Gi F(V) l b cc tp m

* nh ngha 2.1: nh ngha lut m:

Cho n bin vo x1.. xn, mt bin ra y. Lut m R c dng:
IF (x1 l A1) (xi l Ai) (xn l An) THEN y l B
y Ai F(Ui), i = 1.. n, B F(V)
* V d:
Nu mc l l CAO v cp h cha l TRUNG BNH th lng nc x l
CAO
Kosko (1993) a ra mt v d khc, cc con s di y c chuyn th
v minh ha khi nim mt lut m n gin vi mt u vo v u ra p dng
cho cc vn ca b ng c iu khin tc khng kh cho iu ha khng
kh. Cc lut c cho trc. Nu cho nhit l 22 , y l nhit t mc
0.6 v mc m t mc 0.2, vi tt c cc mc nhit khc th t mc 0. iu
ny kch hot hai trong cc lut th hin trong hnh di. Cc phn hi lut c
kt hp cung cp cho nhng gi tr a ra trong hnh 2.1. Nhit (u vo) v
tc (u ra) l cc bin m s dng thit lp cc lut.

Hnh 2.1: ng c iu khin tc khng kh.

32

Mt dng khc ca lut IF - THEN m, c xut bi Takagi v Sugeno

[15,18], c cc tp m tham gia vo ch trong phn gi thit. Bng vic s dng cc
lut IF - THEN m ca Takagi v Sugeno, chng ta c th m t sc chu ng ca
mt vt chuyn ng nh sau:
Nu Vn tc l CAO th Lc = k*(Vn tc)2
Trong , CAO trong phn gi thit l mt nhn ngn ng c c tnh ha
bi 1 hm thuc xp x. Tuy nhin, phn kt lun li c miu t bi mt cng
thc khng m vi bin u vo l vn tc.
C 2 kiu lut m IF - THEN u c s dng rng ri trong m hnh ha
v iu khin. T mt kha cnh khc (gc nhn khc), do gii hn ca phn gi
thit, mi lut m IF - THEN c th c xem nh mt m t cc b ca h thng
ang xem xt. Cc lut IF - THEN m hnh thnh mt phn chnh ca h suy din
m s c gii thiu sau y.

2.1.2. nh ngha h m trn c s cc lut m

H suy din m cng c xem nh h m da trn c s cc lut m, m
hnh m, b nh tng t m hoc cc iu khin m khi s dng trong iu khin.
T tng c bn ca iu khin da vo logic m l a cc kinh nghim
chuyn gia ca nhng ngi vn hnh gii h thng vo trong thit k cc b iu
khin cc qu trnh trong quan h vo ra (input-output) c cho bi mt tp cc
lut iu khin m (dng lut nuth).
* nh ngha 2.2: nh ngha h m trn c s cc lut m
Cho Ui, i = 1.. n l khng gian nn ca bin vo xi, i = 1.. n, cho V l khng
gian nn ca bin ra y. H m MISO (multi input single output) c xc nh
bi b m lut m {R1, , Rm}. Trong lut Rk c dng:
IF (x1 l Ak1) (xi l Aki) (xn l Akn) THEN y l Bk
y :
Aki F(Ui), i = 1.. n, k = 1..m, Bk F(V)
Vi thi gian nghin cu cha c lu song logic m em li nhng ng
dng thc t rt hu ch. Ta c th thy cc ng dng ca n hu khp cc ngnh

33

ngh, lnh vc. C th k y nh: iu khin l nung xi mng (Larsen 1980),

iu khin h thng nng lng v iu khin phn ng ht nhn (Bernard 1988),
iu khin h thng giao thng ngm, qun l nhm thang my (fujitect 1988)
H suy din m c ng dng thnh cng trong cc lnh vc nh iu khin t
ng, h chuyn gia m, nhn dng m, h h tr quyt nh v bi ton ly quyt
nh, bi ton ly quyt nh tp th

2.2. H suy din m

2.2.1. Kin trc c bn ca h suy din m
V c bn, mt h suy din m bao gm 5 khi chc nng [7, 11, 12, 18].
C s tri thc
u vo
Giao din
m ha
M

C s d liu

u ra

B lut
Giao din
gii m

n v thc thi quyt nh

Hnh 2.2: Cu trc c bn ca h suy din m

-

B lut bao gm mt s cc lut m IF - THEN;

C s d liu trong nh ngha cc hm thuc ca cc tp m c s

dng trong cc lut m;

n v thc thi quyt nh trong thc hin cc hot ng suy din trong
cc lut;

Giao din m ha trong chuyn i cc lp u vo vo cc bin ph

hp vi cc gi tr ngn ng;

Giao din gii m trong chuyn i cc gi tr kt qu m ca h suy din

ra cc lp u ra.

Thng thng, b lut v c s d liu l suy din lin kt nh l mt b tri

thc. Vi h m trn c s cc lut m nh trong nh ngha 2.2, cc bc l lun

34

m (hot ng suy din tng ng theo cc lut m IF THEN) c thc hin

bi cc h suy din m nh sau:
So snh cc bin u vo vi cc hm thuc trong phn gi thit t c
gi tr hm thuc (hoc cc n v so snh) ca mi nhn ngn ng. (Bc ny
thng c gi l m ha).
Kt hp (thng qua mt ton t T - chun c th, thng s dng hm
multiplication hoc min) cc gi tr hm thuc trong phn gi thit t c mc
t trng s ca mi lut.
To ra cc kt qu c cht lng (hoc l m hoc tp hp) ca mi lut ty
thuc vo mc t.
Tch hp cc kt qu c cht lng to ra mt tp hp u ra (bc ny
gi l gii m).

2.2.3. Cc bc suy din m

Trong mt h suy din vic thc hin cc thnh phn trn th hin qua cc
buc sau:
- M ho cc bin vo: V nhiu lut cho di dng dng cc bin ngn ng
vi cc t thng thng. Nh vy vi nhng gi tr (r) quan st c, o c c
th, c th tham gia vo qu trnh suy din th cn thit phi m ho.
C th nh ngha, m ho l mt nh x t khng gian cc gi tr quan st
c (r) vo khng gian ca cc t (tp m) trn khng gian nn ca cc bin
ngn ng.
- p dng cc ton t m (AND hoc OR) cho cc gi thit ca tng lut
(tng ng vi cc ton t l vic s dng cc php ton t - chun, t - i chun).
- p dng php kp theo tnh ton gi tr cc gi tr t gi thit n kt
lun ca tng lut.
- p dng ton t gp kt hp cc kt qu trong tng lut thnh mt kt
qu duy nht cho c h.
Ba qu trnh ny c thc hin trong mt suy din ca cu trc suy din.
y l phn ct li nht ca iu khin da vo logic m trong qu trnh m hnh

35

ho cc bi ton iu khin v chn quyt nh ca con ngi trong khun kh vn

dng logic m v lp lun xp x. Do cc h thng c xt di dng h vo-ra
nn lut suy din modus ponens suy rng ng mt vai tr rt quan trng [7, 9].
- Gii m kt qu tm c cho ta mt s r: y l khu thc hin qu trnh
xc nh mt gi tr r c th chp nhn c lm u ra t hm thuc ca gi tr
m u ra. C hai phng php gii m chnh: Phng php cc i v phng
php im trng tm. Tnh ton theo cc phng php ny khng phc tp, chng
ta s xem chi tit phn sau.
2.2.3.1. M ha
M ha c nh ngha nh l s nh x (s lm tng ng) t tp cc gi
tr thc x* U Rn thnh tp cc gi tr m A trong U. Nguyn tc chung vic
thc hin m ha l:
- T tp gi tr thc x u vo s to ra tp m A vi hm thuc c gi tr
rng ti cc im r x*.
- Nu c nhiu u vo th vic m ha s gp phn kh nhiu.
- Vic m ha phi to iu kin n gin cho tnh ton sau ny.
Thng thng dng ba phng php m ha sau y:
- M ha n tr (Singleton fuzzifier). M ha n tr l t cc im gi tr
thc x* U ly cc gi tr n ca tp m A, ngha l hm thuc c dng:
1 nu x = x *
A( x ) =
0 cc tr ng h p khc
- M ha Gaus (Gaussian fuzzifier). M ha Gaus l t cc im gi tr thc
x* U ly cc gi tr trong tp m A vi hm thuc Gaus.
- M ha hnh tam gic (Triangular fuzzifier). M ha hnh tam gic l t cc
im gi tr thc x* U ly cc gi tr trong tp m A vi hm thuc dng hnh
tam gic (hoc hnh thang).
Ta thy m ha n tr cho php tnh ton v sau rt n gin nhng khng
kh c nhiu u vo, m ha Gaus hoc m ha hnh tam gic khng nhng
cho php tnh ton v sau tng i n gin m cn ng thi c th kh nhiu
u vo.

36

2.2.3.2. Gii m
Gii m c nh ngha nh l s nh x (s lm tng ng) t tp m B
trong tp c s V (thuc tp s thc R; V R; l u ra ca khi hp thnh v
suy lun m) thnh gi tr r u ra y V. Nh vy nhim v ca gii m l tm
mt im r y V lm i din tt nht cho tp m B. C ba iu lu sau y
lc chn phng php gii m:
- Tnh hp l ca kt qu. im r y* V l im i din (cho nng
lng) ca tp m B, iu ny c th cm nhn trc gic tnh hp l ca kt qu
khi c hm lin thuc ca tp m B.
- Vic tnh ton n gin. y l iu quan trng tnh ton nhanh, v cc
b iu khin m thng lm vic thi gian thc.
- Tnh lin tc. Mt s thay i nh trong tp m B ch lm thay i nh kt
qu gii m, ngha l khng gy ra thay i t bin gi tr gii m y V.
Nh vy, gii m l qu trnh xc nh mt gi tr r u ra theo hm lin
thuc hp thnh tm c t cc lut hp thnh v iu kin u vo. C ba
phng php gii m thng dng l: phng php cc i, phng php trng
tm v phng php trung bnh tm.
a) Phng php cc i
Phng php cc i gm hai bc:
Bc 1: Xc nh min cha gi tr r u ra. l min G, m gi tr r u
ra y c hm lin thuc t gi tr cc i, ngha l:
G={yY | B(y)=max}
Bc 2: Xc nh gi tr y t min G. Lc ny c ba cch tnh:
+ Cch tnh trung bnh, chng hn nh trn hnh 2.3 th:
y=

y1 + y2
2

+ Ly gi tr cn tri. Trn hnh 2.3 ly y = y1.

+ Ly gi tr cn phi. Trn hnh 2.3 ly y = y2.

37

Tt nhin trong mt s trng hp, phng php cc i ny s gp kh

khn chng hn nh khi hm thuc hp thnh c dng nh hnh 2.6. Lc ny cn
phi dng thm mt s tiu chun u tin khc, chng hn nh ta u tin ly vng
G1 hay vng G2 (c th theo kinh nghim thc t hay kin chuyn gia ) v t
mi p dng cch tnh ton trn.

Hnh 2.3: Gii m bng phng php

cc i

Hnh 2.4: Gii m bng phng php

trung bnh

b) Phng php trng tm

Lc ny gi tr r u ra c ly theo im trng tm ca hnh bao bi hm
lin thuc hp thnh v trc honh (hnh 2.5).

Hnh 2.5: Gii m theo phng

php trung bnh tm

y=

y. B ( y)dy
S

B ( y)dy
S

Hnh 2.6: Hm thuc hp thnh dng i xng

Trong S l min xc nh ca tp m.

38

Phng php trng tm c u im l c tnh n nh hng ca tt c cc

lut iu khin n gi tr u ra, tuy vy cng c nhc im l khi gp cc dng
hm thuc hp thnh nh trn hnh 2.6 (dng i xng) th kt qu sai nhiu; v gi
tr tnh c li ng vo ch hm lin thuc c gi tr thp nht, thm ch bng 0,
iu ny hon ton sai v suy ngh v thc t. trnh iu ny, khi nh ngha cc
hm thuc cho tng gi tr m ca mt bin ngn ng nn ch sao cho lut hp
thnh u ra trnh c dng ny, c th bng cch kim tra s b qua m phng.
Hn na vic tnh ton cng thc tng i phc tp c bit khi hm thuc hp
thnh c dng phc tp, iu lm nh hng n tc iu khin.
c) Phng php ly trung bnh tm
V tp m hp thnh B thng l hp hoc giao ca M tp m, do vy ta c
th tnh gn ng gi tr y l trung bnh theo trng s ca tm ca M tp hp thnh.
Gi y-l l im trung bnh (im gia) v hl l chiu cao ca tp m th l, gi tr gii
M

y m theo phng php trung bnh tm l: y =

y 1.hl
l =1
M

hl
l =1

Hnh 2.7: Gii m trung bnh tm vi m=2

V d, cho tp m hp thnh B l hp ca 2 tp m nh hnh 2.7. Kt qu
tnh ton gii m theo hai phng php trng tm v trung bnh tm nh bng
2.1. Ta thy sai lch kt qu gia hai phng php ti a ch vo khong 16%.

39

Hnh 2.7 minh ha cho phng php gii m trung bnh tm vi m = 2.

Phng php gii m trung bnh tm l phng php c s dng nhiu nht
trong iu khin m.
h1

h2

ytt

ytb

(theo trng tm)

(theo trung bnh tm)

Sai lch tng i

(ytt ytb)/ytt

0.9

0.7

0.4258

0.4375

0.0275

0.9

0.5

0.5457

0.5385

0.0133

0.9

0.2

0.7313

0.7000

0.0428

0.6

0.7

0.3324

0.3571

0.0743

0.6

0.5

0.4460

0.4545

0.0192

0.3

0.5

0.2155

0.2500

0.1600

0.3

0.2

0.3818

0.4000

0.0476

Bng 2.1: Kt qu phng php gii m trung bnh tm vi m = 2

2.2.4. Mt s phng php suy din trong h m

2.2.4.1. Thut ton suy din m tng qut
* Dng tng qut ca thut ton suy din m gm cc bc sau:
1. Vi mi lut Ri tm mc t (kch hot) i
2. Vi mi lut Ri s dng mc t i v tp h qu Bi, tm u ra thc Bi
3. Gp cc u ra ring r ca cc lut tnh u ra gp ca ton h B
4. Gii m, tm kt qu ra ca ton h y*
tin cho ci t thut ton suy din c th, ta xt trng hp sau: ng vi
lut m Ri, xt cc gi tr m Aij, j = 1,2,, n l nhng tp m trn tp bin ngn
ng Xi.
Bi ton suy lun tng qut vi m lut m:
Mnh 1

Nu X1= A11 v.. v Xn = A1n th Y = B1

40

Mnh 2

Nu X1= A21 v.. v Xn = A2n th Y = B2

.
Mnh m

Nu X1= Am1 v.. v Xn = Amn th Y = Bm

Kt lun

Y=B0

Chng ta c th nhn thy rng phn ct li ca nhiu h m cho bi c s

tri thc dng R = {cc lut Ri} v cc c ch suy din ci t trong m t suy din
[1, 2, 11]
2.2.4.2. Thut ton suy din Max-Min (Phng php Mamdani)
Tn hiu u vo l vect x* = (x1*, x2*,.., xn*)
1. Vi mi lut Ri, tnh i = min (Aij(xj*): j = 1,2,, n)
2. Xc nh Bi(y) = min (i, Bi(y)), vi mi yV
3. Xc nh B(y) = max(Bi(y): i = 1,2,m)
4. Gii m tp B, thu c kt qu y* l mt s r
2.2.4.3. Thut ton suy din Max-Prod (Phng php Larsen)
Tn hiu u vo l vect x* = (x1*, x2*,.., xn*)
1. Vi mi lut Ri, tnh i = j (Aij(xj*): j = 1,2,, n)
2. Xc nh Bi(y) = min (i, Bi(y)), vi mi yV
3. Xc nh B(y) = max(Bi(y): i = 1,2,m)
4. Gii m tp B, thu c kt qu y* l mt s r
Ty thuc vo kiu suy din m v cc lut m IF - THEN c s dng,
hu ht h suy din m c th c chia thnh 3 kiu:
Kiu 1: Ton b u ra c tnh trung bnh trng s ca mi m hnh lut
u ra c to ra bng mc t ca lut (tch hoc min ca ph hp vi phn
gi thit) v cc hm thuc u ra. Cc hm thuc u ra c s dng trong kiu
h ny phi l hm n iu.

41

Kiu 2: Ton b u ra m c chia ra bng vic p dng ton t max

kim tra u ra m (mi u ra bng vi min ca mc t v hm thuc u ra ca
mi lut). Nhiu h khc nhanh c a ra la chn kch bn u ra cui
cng da trn ton b u ra m.
Kiu 3: S dng cc lut m IF - THEN ca Takagi v Sugeno. Mi u ra
ca mi lut l mt hm kt hp tuyn tnh cc bin u vo cng vi mt hng
ng, v kt qu u ra cui cng c tnh trung bnh trng s ca mi lut.
Chng ta s nghin cu k hn m hnh suy din m dng Takagi v Sugeno
[20] chng sau.

42

CHNG III - LP LUN XP X TRONG H M TRN C

S CC LUT M
Ty thuc vo nh dng ca cc lut, cc m hnh h m ri vo hai nhm
m khc nhau v c bn kh nng i din cho cc loi thng tin khc nhau.
Nhm u tin l M hnh ngn ng - Linguistic Models (LM). Trong cc m hnh
ny s lng m c lin kt vi cc nhn ngn ng, v m hnh m v bn cht
l mt biu hin cht lng ca h thng. M hnh kiu ny ng vai tr c bn
cho m hnh ha m t cc hnh vi ca h thng bng cch s dng mt ngn ng
t nhin.
Nhm th hai l cc m hnh m da trn phng php suy lun Takagi Sugeno - Kang (TSK) c xut bi Sugeno v cc ng nghip [19, 20].
Nhng m hnh ny c hnh thnh bi cc lut logic trong bao gm phn gi
thit m v hm kt lun; thc cht l s kt hp ca cc m hnh m v khng
m. Cc m hnh m da vo phng php TSK v kh nng suy lun tch hp ca
LM cho i din cht lng tri thc vi mt tim nng hiu qu cho th hin thng
tin nh lng l tt. Ngoi ra, kiu m hnh ny cho php d dng c cc ng dng
tng ng bng nhng k thut mnh m xc nh vic hc t d liu. Chng ta
s xem xt cc m hnh loi ny nh l m hnh m TSK.

3.2. M hnh ngn ng - Linguistic models (LM)

Mt trong nhng hng chnh trong l thuyt h m l cch tip cn ngn
ng c khi xng bi Zadeh. M hnh ngn ng l mt h tri thc c s to
thnh t cc lut trong kt hp cc kin thc m v th gii thc. Ta s c
nhng din gii khc nhau v tri thc c trong m hnh lut kt hp s a ra
nhng c ch cc lut khc nhau v kt qu l cc loi m hnh ngn ng khc
nhau. Chng ta bt u vi trng hp h mt u ra mt u vo.
h mt u ra mt u vo, tri thc m ha c th c th hin bng b
cc lut dng IF - THEN.
IF U l B1

THEN V l D1
ALSO

43

(3.1)
ALSO
IF U l Bm THEN V l Dm
cng thc trn, U l bin u vo v V l bin u ra ca LM. Bi v Di l
tp con m ca cc c s tp hp X v Y ca U v V. Thng thng cc tp m Bi
v Di tng ng vi nhn ngn ng. Hm thuc ca tp m Bi, Di c k hiu ln
lt l Bi(x) v Di(y). Phn bn tri ca lut, c gi l gi thit v c lin quan
n u vo ca h thng; pha bn phi gi l h qu, lin quan n u ra ca
lut.
Cc LM c th c coi nh mt h thng chuyn gia ngn ng m t cho
mt h thng phc tp cho sn. Tp cc lut c th c xem nh mt php loi
suy t tp hp cc cng thc c s dng biu din cc h thng tuyn tnh v
phi tuyn trong cc k thut m hnh ha c in. Cc tp m Bi v Di l cc thng
s ca LM; s lng cc lut xc nh cu trc ca LM. tng quan trng y
l phn vng khng gian vo X vo cc vng m, mi lut c lin kt vi u ra
ring ca n. Vai tr ca cc tp m l to thnh ht (b) ca cc gi tr u vo
- u ra. Cc b ny c kt hp vi tng lut ring l. Trong mt trng hp hn
ch khi mi b cha ch mt u c v LM trng vi mt tp hp cc d liu u
vo - u ra. S lng lut ca m hnh lut c s cn thit m t c trng kh
nng cho m hnh cho tng qut.

3.3. Suy din vi m hnh m

Trong phn ny chng ta m t c ch c ch lp lun c bn vi cc m
hnh ngn ng bng cch xem xt trng hp ca mt h thng mt lut. My mc
c s dng pht trin c ch ny l lun da trn l thuyt v l lun gn
ng gii thiu ca Zadeh. Theo l thuyt v lp lun xp x ca mt lut dng:
IF U l B THEN V l D

(3.2)

c th c dch ra mt xut dng (U,V) l R trong R l mt quan h m c

nh ngha trn khng gian cc X Y. Cho u vo m U l A kt ni vi lut
(3.2) v c quan h (U,V) l G trong :

44

G = A R.

(3.3)

G l mt tp m cng c nh ngha trn khng gian X Y c hm thuc:

G(x,y) = A(x) R(x,y)

(3.4)

p dng lut chiu chng ta c u ra V l F trong F l mt tp con m

ca Y,
F(y) = x(G(x,y)) = x(A(x) R(x,y))

(3.5)

Cng thc trn c th c vit li rt gn hn di dng lut suy din maxmin nh sau:
F=AR

(3.6)

trn, phn giao m ca A v R l G c xc nh bi ton t min (). Mt

cch bin dch khc s dng t - chun nhn thay v ton t min cho ta lut suy din
max-prod:
F= A R

(3.7)

theo cng thc ny, hm thuc ca tp m F c suy lun ra t quan h R l:

F(y) = x(G(x,y)) = x(A(x). R(x,y))

(3.8)

Thc cht, lut suy din l mt dng ton t ca m hnh ngn ng; n c
xem nh l mt nh x m xc nh mt chuyn ha ca gi tr m u vo ti u
ra. l mt cch biu din li ca m hnh, c bit trong cc trng hp hn ch
khng gian trnh by. ng dng ca lut suy din cho cc tnh ton c th l kh
gii hn, c bit y l trng hp khi u vo ca h thng l gi tr dy s. Tuy
nhin, chng ta s dng n biu din li trong mt dng chuyn ha rt gn
c xc nh bi m hnh ngn ng.
i vi cc khng gian gii hn X v Y c p v q, chng ta c th biu din
cc tp m A v B, D v F bng cch s dng cc vc t hm thuc l cc dng ca
cc vc t [A] v [B], [D] v [F] vi s chiu p v q tng ng, v quan h m R l
mt ma trn [R] c (p q) chiu. Sau cc lut max-min v max-product ca suy
din c th vit li di dng ma trn:
[F] = [A] [R]
[F]= [A] [R]

(3.9)
(3.10)

45

Kim tra li cng thc (3.5) v (3.8) ch ra rng cc dng ma trn ca cc

lut suy din dng max-min (3.9) v max product (3.10) l dng c bit ca
php nhn trong (inner products) vc t [A] v ma trn [R] trong php tng c
thay th bi ton t max () v trong trng hp lut max product th php nhn
c thay th bi mt ton t min().
T cc cng thc trn, chng ta ch ra rng mt lut m tng ng vi mt
quan h m R l bn cht chung. Hn na khng c mt xem xt no ti trng
hp c lut c nhiu bin, qu trnh kt hp cc u ra ca cc lut ny. phn
sau, chng ta s trnh by 2 tip cn c th v cch chuyn ha cc lut vo mt
quan h m v lin quan n cc ton t kt hp. 2 tip cn ny a n 2 c ch
suy din khc c kh thi trong cc m hnh.

3.4. M hnh Mamdani (Constructive) v Logical (Destructive)

Trong m hnh Mamdani, quan h kt hp vi mt lut c th c c thng
qua mt kt hp ca gi thit v kt lun ca lut. Hn na, trong cc m hnh ny
ton b u ra h thng t mt tp cc lut c xy dng bi vic thm vo cc
u ra ca tng lut ring bit. Theo cch ny, mi lut c dng:
IF U l Bi THEN V l Di

(3.11)

c gii thch nh mt im m, 2 thng s, v c biu din nh mt

quan h Ri l quan h c c nh mt pho giao m ca 2 tp m Bi v Di:
Ri = Bi Di

(3.12)
y

D2(y)

Ri(x,y)
B2(y)
x

Hnh 3.1: Phn phi kt hp lut R1(x,y): IF U l Bi THEN V l Di

Ri nh ngha trong khng gian cc X Y, c hm thuc nh sau:

46

Ri(x,y) = Bi(x) Di(y)

(3.13)

Biu thc trn c ngha l quan h m Ri nh dng mt min hnh ch nht

trong khng gian cc X Y (xem hnh 3.1) vi php phn phi nh cng thc
(3.13)

3.4.1. Phng php lp lun Mandani

Theo phng php Mamdani, kt ni ngn ng gia cc lut ring bit c
gii thch nh mt php kt hp OR, vic tch hp cc lut c hon thnh thng
qua mt quan h m c th nht nh:
R=

Ri

(3.14)

j =1

Cch biu din ny dn n mt suy din t nhin ca m hnh ny. Hm

thuc ca ton b u ra R c cho bi cng thc:
m

i =1

i =1

R ( x, y ) = Ri ( x, y ) = ( Bi ( x ) Di ( y ))

(3.15)

Vi mt u vo cho trc U = A, u ra F t c bi phng php ny

c nh ngha bi cng thc suy din max-min
m
m

F = A oR = A o URi = A o U( Bi Di )
i =1
i =1

(3.16)

Vi hm thuc ca F ta c:
m

F ( y ) = [ A( x) R ( x, y )] = ( A( x) R ( x, y ))
x
x i=1

F ( y ) = ( A( x) Bi ( x) Di ( y ))
i =1 x

F ( y ) = [ i Di ( y )]
i =1

Trong :

(3.17)

47

i = Poss[ Bi | A] = [ Bi ( x) A( x)]
x

(3.18)

Gi thit rng iu kin kh thi Bi ca A cho trc, i l mc t (DOF) ca

lut th i.
Trong cng thc (3.17), tnh suy din t nhin vn c ca tip cn ny tr
nn rt r rng. Chng ta thy rng u ra c suy din bng mt trng s kt hp
ca cc u ra ca mi lut. C th nu khng c mc t ca lut no th u ra l
gi tr rng (null). T chng ta thy m hnh ny l mt kiu chng ln lin tip
cc lut ring bit.
Trong trng hp c bit, thng xy ra trong b iu khin logic m, l b
lut c u vo l mt gi tr xc nh x* X, tp m u vo A l mt n tr logic
m vi hm thuc mt lp ti x* v s khng ni khc trn v tr X.
0 nu x x*
A( x) =
1 nu x =x*
Trong trng hp ny biu thc (3.18) cho mc t (DOF) tr thnh:

i = Poss[ Bi | A] = Bi ( x*)

(3.19)

Tm li, chng ta c c cc thut ton sau y tnh u ra l c

phn nh bi mt LM (1) bng phng php Mamdani gi thit cho u vo U = A
hay U = x*.
Thut ton 1:
1. Vi mi lut ca LM (1) - tnh ton DOF - cc i ca lut

i = x[Bi(x) A(x)] nu u vo l mt tp m A
i = Bi(x*) nu u vo l mt dy s x*
2. Tm tp m Fi c phn nh bi lut th i
Fi ( y ) = i Di ( y )
3. Tng hp cc tp m suy din Fi bng cch s dng ton t max.
m

F ( y ) = Fi ( y )
i =1

48

IF U is B1 THEN V is D1
1 = x ( B1( x ) A( x ))

1 D1( y ))

IF U is B2 THEN V is D2

2 = x ( B 2( x ) A( x ))

F2

2 D 2( y))

V=F

...

U=A

F1

IF U is Bm THEN V is Dm

m = x( B m( x ) A( x ))

Fm

m D m( y))

Hnh 3.2: Phng php lp lun Mamdani/Constructive

Hnh 3.2 biu din s khi ca c ch trong ca h LM SI-SO l h da
trn phng php suy din Mamdani.

Hnh 3.3: Kt qu tnh ton u ra bng hnh phng php Mamdani

49

Hnh 3.3 biu din mt dng ha ca ng dng phng php Mamdani

tnh gi tr u ra m F t mt h 2 lut gi s rng u vo l mt tp m A.
IF

B1

THEN

D1

THEN

D2

ALSO
IF

B2

3.4.2. Phng php lp lun logic

Cc m hnh kiu logic da trn mt gii thch thay th cho cc nh ngha
ca mi quan h Ri thu c t cc lut v cc th tc tch hp ca cc lut ring l.
Khi chng ta xem m hnh ngn ng kiu logic t c trong mt tnh hung m
u ra tng qut t c c bng cch loi b kh nng khng chp nhn cc
lut ring bit v nh vy c th c xem nh l mt phng php ph hy.
Trong phng php ny mi lut ring l:
IF

Bi

THEN

Di

c dch bi mt gii thch logic ca ton t IF-THEN v cc kt qu nh

vy trong mt mi quan h m Ri c xc nh bi:
Ri = B i Di

(3.20)

Cc mi quan h m Ri nh ngha trn khng gian cc X Y c hm

thuc:
Ri ( x, y ) = Bi ( x) Di ( y )

(3.21)

Trong B i ( x) = 1 Bi ( x)
Theo cch tip cn ny kt ni gia cc lut ring l, ALSO, c dch nh
l mt kt qu lin kt trong vic tch hp cc lut ring l, tr nn hon chnh bi
php giao:
m

R = I Ri
i =1

(3.22)

Do trong trng hp quan h m R c kt ni phn phi kh nng

50
m

i =1

i =1

R ( x, y ) = Ri ( x, y ) = B i ( x) Di ( y )

(3.23)

Vi mt tp m u vo cho trc U = A, u ra suy ra s dng phng

php logic thu c bng cch suy din lut max-min.
m
m

A oR = A o I Ri = A oI ( B i Di )
i =1
i =1

Chng ta gi s A oR l mt tp con m F, lp thuc ca n l

m

G ( y ) = [ A( x) R ( x, y )] = ( A( x ) Ri ( x, y ))
x
x i =1

= [ Bi ( x) A( x ) Di ( y ) A( x)]
x i =1

By gi hy xem xt cc tp con m F c:

F ( y ) = [ B i ( x) A( x) Di ( y ) A( x)]
i =1 x

chng t G(y) F(y) vi mi y, i.e., G F. Khi gi tr bin dch V l F v G

F th bng vic s dng quy tc k tha chng ta c th suy ra V l F. Vi F thc
s nh hn G, l mt suy din thc s ng chng ta s thy y l mt cng
thc c ch cho suy din.
Gi s rng A(x) l dng thng thng, A(x) = 1 vi mt s x, chng ta c
cng thc sau:
m

F ( y ) = [ i Di ( y )]
i =1

(3.24)

Trong

i = Poss[ B i | A] = [ B i ( x) A( x)]
x

iu kin kh nng B i | A biu din mc t ca lut th i.

(3.25)

51

Nu chng ta xt li trng hp c bit vi tp u vo x*, tp m A l mt

tp m c hm thuc dng:
0 if x x*
A( x) =
1 if x = x*
Khi cng thc (3.14) biu din mc t l:

i = Poss[ B i | A] = 1 Bi ( x*) = 1 i
Trn y l tm tt ca thut ton sau tnh ton u ra bin dch bi LM
thng qua phng php logic:
Thut ton 2:
1. i vi mi lut ca LM (1) tnh:

i = x[ Bi A( x)] nu u vo l mt tp m A;
i = 1 Bi (u ) Nu u vo mt tp hp s u.
2. Tm tp m Ei suy ra bi cc lut
Fi ( y ) = i Di ( y )
3. Tch hp cc tp m c suy din Ei bng cch s dng ton t min:
m

F ( y ) = Fi ( y )
i =1

T thut ton trn chng ta c th thy bn cht ca s ph hy t nhin ca

tip cn ny. Trc tin chng ta ch rng mt lut c i =0, i =1, t Fi = Y
v n khng ng vai tr trong qu trnh tch hp ca bc th 3. Mt khc nu i
=1, i = 0, th Fi = Di v trong bc th 3 n t kh bt k phng n no vi hm
thuc thp trong Di.
Hnh 3.4 biu din s khi ca c ch suy din da vo phng php lp
lun logic.

52

Hnh 3.4: S khi ca phng php lp lun lgic

Thut ton tnh ton u ra ca LM (Hnh 3.3), thng qua phng php
logic, c biu din bng dng th hnh 3.5:

Hnh 3.5: Tnh ton kt qu u ra bng hnh ca phng php logic

53

M rng 2 tip cn trn vi m hnh ngn ng c th lm c bng cch

hin thc ha cc ton t max v min s dng trong cng thc (3.17) v (3.24)
ch l nhng trng hp c th ca t - chun v t - i chun. T , chng ta c
th c th cc biu thc (3.17) v (3.24) dng thng dng hn ca u ra vi cc
m hnh kiu Mamdani (contructive) v kiu logic (destructive)
m

F ( y ) = [ i Di ( y )]
i =1

(3.26)

E ( y ) = [ i Di ( y )]
i =1

(3.27)

Trong v l cc ton t t - chun v t - i chun tng ng. V d,

nu ton t nhn i s c xem trong (3.26) l mt t - chun chng ta c gii m
theo phng php Larsen:
m

F ( y ) = [ i Di ( y )]
i =1

Hnh 3.6: Biu din cc quan h m R tng ng vi phng php Mamdani

V phng din hnh hc, mt m hnh ngn ng c dng mt vng m
trong khng gian X Y. Di tip cn Mamdani, vng ny c nh ngha bi
hm thuc R xc nh bi ly quan h m duy nht Ri, i = 1,..., m l quan h c
c t cc quan h c th khc nhau s dng biu thc (3.12); quan h R v R i

54

c ch ra trong hnh 3.6. Cc phng php l lun khc ch ra cc hm thuc c

th cho quan h m R. Nu tp h tr ca tp m B i v Di ngy cng hp hn,
chng ta c th s c trng hp hn ch ton b h thng m hnh nh l mt cp
u vo u ra.

3.5. M hnh ngn ng vi tp hp cc u ra

Trc y chng ti gii thiu u ra ca m hnh m l mt tp m.
Trong nhiu ng dng, c bit trong iu khin logic m, chng ta cn m hnh
u ra theo ngha l mt tp hp gi tr c th ng dng vo cc h thng m
hnh ha. Nhm p ng iu ny, chng ta buc phi gii m gi tr u ra F.
Trong ti liu [20], Yager v Filev cung cp mt tho lun k v quy trnh gii
m. Phng php thng dng nht thng c s dng trong cc m hnh m l
phng php trng tm (COA). Phng php ny xc nh gi tr c gii m l
trng tm m:
y* =

) ( F ( y)dy )

yF ( y )dy /

(3.28)

Vi mt U xc nh, ta c:
q
q

y* = yi F ( yi ) / F ( yi )
j =1
j =1

(3.29)

Trong q l thnh phn trong tp Y.

Trong trng hp khi mt tp biu din ca m hnh u ra V c yu cu,
thut ton 1 v 2 nn c hon chnh bng mt bc b sung tnh ton gi tr tp
hp u ra y* da vo cng thc (3.28) hoc (3.29).
Xem mt cch chi tit hn cc thut ton cho thy chng vn l phi tuyn
ty thuc v vic s dng ton t min v max; vic s dng cc ton t ny khng
cho biu thc phn tch quan h gia cc bin u ra v u vo. gim hiu ng
phi tuyn trong m hnh Mamdani c th s dng ton t nhn (l t - chun) thay v
ton t min. Nh cp trc, kiu suy din m ny c bit n l phng
php Larsen. T , cng thc tnh gi tr m l:
m

i =1

i =1

F ( y ) = Fi ( y ) = i Di ( y )

(3.30)

55

Hnh 3.7: S khi ca c ch suy din n gin

n gin hn na, thng p dng trong cc ng dng, thay th ton
t max s dng cho php tch hp cc Fi bng mt php cng n [20]. Trong
trng hp ny ta c:
m

i =1

i =1

F ( y ) = Fi ( y ) = i Di ( y )

(3.31)

R rng vic s dng php cng c th a ti thuc ca F(y) qu mc

n v. Tuy nhin, n khng c nh hng n gi tr gii m, do c vic chun
ha trong cng thc (3.28) v (3.29). Bng vic tay th cho F(y) trong cng thc
(3.29) chng ta c gi tr gii m trng tm:
m
m
y* = i y * / i
i =1
i=1

(3.32)

Trong cc yi l trng tm ca mi tp m tng ng vi Di. T gi tr

gii m COA suy ra bi m hnh c xc nh bng trung bnh trng s ca trng
tm mi tp m ring bit tng ng. Biu thc trn ca gi tr gii m c gi l
phng php suy din m n gin. u im chnh ca vic thay th max
aggregation bng mt hm tng l mt cch n gin dn n mt nh dng n

56

gin ca c ch suy din. Dng n gin ny cho php mt biu thc phn tch cho
quan h gia cc u v v u ra, v n m ra mt kh nng hc cc m hnh
m t d liu. Cng nh t biu thc (3.32), gii thut xc nh tp hp gi tr
u ra ca m hnh Mamdani thng qua 2 bc: tnh ton DOF, i v cc gi tr
thay th vo mt cng thc cui cng (3.32). Cc ton t ca vic tm kim tp m
suy din bi tng lut ring bit, vic kt hp v gii m b b qua. Phng php
suy din m n gin ha c trnh by dng s khi trong hnh 3.7.

3.6. M hnh Takagi Sugeno Kang (TSK)

3.6.1. M hnh
Sugeno v cc cng s [20] xut mt kiu khc ca m hnh h m, gi l
kiu lp lun TSK (Takagi Sugeno Kang). Phng php lp lun TSK c kt
hp vi mt lut c nh dng c bit m c m t bi hm kiu dy thay v
mt dy m s dng trong LM phn trn. Trong kiu m hnh ny, lut c dng:
IF u1 l B11 AND AND ur l B1r THEN y = b10 +b11u1+ + b1rur
ALSO

ALSO
IF u1 l Bm1 AND AND ur l Bmr THEN y = bm0 +b11u1+ + b1rur
Trong m hnh ny, Bij, j = 1r, i =1, , m l cc bin ngn ng c nh
ngha nh l cc tp suy din m thng quan khng gian vo X1, X2,, Xr ca mt
h MISO; u1, u2, , ur l gi tr ca cc bin vo. Mi hm tuyn tnh trong phn
kt lun ca lut c th c xem nh mt m hnh tuyn tnh vi tp cc u vo
u1, u2, , ur, tp cc u ra i v cc bin bij, j = 1r, i =1, , m. Tp u ra y dch
bi m hnh m theo phng php TSK c nh ngha bng trung bnh trng s
ca tp cc u ra yi ca tng h con tuyn tnh.
m m
m
y = i y / i = i (bi 0 + bi1u1 + ... + biru r ) / i
i =1
i =1 i =1
i =1
m

(3.33)

Trong DOF ca lut th i l:

i = Bi1 (u1 ) ... Bir (u1)

(3.34)

57

V mt hnh hc, cc lut ca m hnh lp lun TSK tng ng vi xp x

nh x X1, X2,, Xr Y bi mt hm tuyn tnh.
Trong mt thit lp tng qut cc hm tuyn tnh trong mt dy cc lut c
th c thay th bi cc hm phi tuyn. Trong trng hp m hnh TSK tr
thnh mt tp cc lut c dng:
IF u1 l Bi1 AND AND ur l Bir THEN yi = fi(u1,,ur)

(3.35)

Trong u ra ca cc h thng con phi tuyn c kt hp mt cch

tng t vo cc trng hp biu din tuyn tnh (3.33).
- Nu fi(u1,,ur) l mt a thc th kt qu suy din c gi l M hnh m
Sugeno dng 1
- Nu fi(u1,,ur) l mt hng s th n l m hnh m Sugeno dng 0 (trng
hp c bit ca m hnh Mamdani)
T biu thc (3.33) cho thy phng php lp lun n gin ha l mt
trng hp c bit ca TSK trong bij = 0 vi i = 1,.., m, j = 1,..., r.
Trng hp 2 lut vi m hnh Sugeno dng 1 th:
+ Mi lut c mt kch bn u ra
+ Ton b u ra c c bng phng php tch hp trng s
+ Khng cn phi gii m
Mt trong nhng khc bit cn bn gia m hnh Mamdani v
TSK l phn kt lun ca lut, tng ng l m v b r nt. Do , cc th tc
tham gia vo vic tnh ton ca cc tn hiu u ra l ring bit. Nu trng hp
kin trc m TSK th u ra c tnh ton vi mt cng thc n gin (trung bnh
trng s, trung bnh tng hp) th kin trc m Mamdani i hi mt n lc tnh
ton cao hn v n cn thit tnh ton ton b hm thuc m sau phi gii m.
y chnh l u im tip cn TSK tr nn c ch hn mc d Mamdani c bn
cht trc quan hn vi ngha x l khng chc chn.
u im ln ca m hnh TSK nm trong sc mnh i din ca n, c bit
l m t cc quy trnh cng ngh phc tp. N cho php chng ta a mt h
thng phc tp vo h thng con n gin (ngay c trong mt s trng hp l h
thng ph tuyn tnh). y khng phi l khi nim, m n c pht trin t

58

nhng nm 1970 qua mt s kt qu ca Rajbman v cc cng s [18,19]. Cc

phng php tip cn cc khi nim c xut bi Rajbman l a cc khng
gian tng th ca h thng vo nhng vng ring bit, v phn bit cc h thng
ng ca nhng vng ny vi cc vng khc, thng l cc m hnh phi tuyn
(phn bit mi loi vi cu trc v cc thng s ca ring n). iu ny cho php
xem cc i din ca cc m hnh tng th ca mt h thng phi tuyn nh l mt
tp hp cc h thng con c kt hp da trn mt hm la chn (logic boolean).
Tuy nhin trn thc t, s phn chia nh th l khng th do vic thiu bin t
nhin trong h thng v cng bi v s a dng ca tri thc t nhin v h thng.
M hnh TSK cho php chng ta thay th phn hy r nt ca mt phn hy m, v
thay th cc chc nng chuyn i Boolean bi c ch l lun TSK. Hn na,
cc m hnh TSK cho php chng ta gii thiu cc kin thc ca chuyn gia trong
cc phn vng ca u vo v khng gian chung c th c bit hu ch trong
trng hp vng khc lin kt vi iu kin hot ng khc nhau c th c xc
nh bng cch s dng cc nhn ngn ng.

3.6.2. Mt s v d m hnh TSK n gin

* V d 1: M hnh Sugeno 1 u vo 1 u ra vi 3 lut:
IF X l nh THEN Y=0.1X + 6.4
I F X l trung bnh THEN Y=-0.5X + 4
I F X l ln THEN Y = X-2
* V d 2: M hnh Sugeno 2 u vo 1 u ra vi 4 lut:
R1: IF X l nh v Y l nh THEN z = - x+y+1
R2: IF X l nh v Y l ln THEN z = -y + 3
R3: IF X l ln v Y l nh THEN z = -x + 3
R4: IF X l ln v Y l ln THEN z = x + y + 2
R1 (x n) & (y n) w1
R2 (x n) & (y l) w2
R3 (x l) & (y n) w2
R4 (x l) & (y l) w2

59

Tch hp cc lut theo phng php trung bnh trng s:

F[(w1,z1);(w2,z2);(w3,z3);(w4,z4)]
Kt qu trn th nh hnh 3.8:

Hnh 3.8: Biu din hnh hc ca h suy din v d 2

60

CHNG 4 B CNG C LOGIC M CA MATLAB V CI

T TH THUT TON
4.1. Gii thiu chung mi trng MATLAB
MATLAB (Matrix Laboratory) theo tn gi ca n, l mt cng c phn
mm ca MathWork, ban u c pht trin nhm phc v ch yu cho vic m
t cc nghin cu k thut bng ton hc vi nhng phn t c bn l ma trn.
Trong cc lnh vc k thut chuyn ngnh nh in v in t, vt l ht nhn, iu
khin t ng, robot cng nghip, trong cc ngnh x l ton chuyn dng nh
thng k - k ton v ngay c trong lnh vc nghin cu v gen sinh hc hay kh
hu v thi tit thng gp nhng d liu ri rc (discret) ta c th lu tr di
dng ma trn. Cn i vi d liu lin tc (continuous) nh m thanh hnh nh,
hoc n gin nh cc i lng vt l tng t (analog): in p, dng in, tn
s, p sut, lu lng phi c bin i thnh cc tn hiu s (digital) ri mi
tp hp li trong cc file d liu. Qu trnh c th c x l bng cc hm ton
hc ca Matlab [17].
Mc pht trin ca Matlab ngy nay chng t n l mt phn mm c
giao din cc mnh cng nhiu li th trong k thut lp trnh gii quyt nhng
vn a dng trong nghin cu khoa hc k thut.
Trc ht, cc cu lnh ca Matlab c vit rt st vi m t k thut khin
cho vic lp trnh bng ngn ng ny c thc hin nhanh hn, d hn so vi
nhiu ngn ng tr nn thng dng nh Pascal, Fortran Nhng hm sn c
trong Matlab c cu trc thit lp gn ging nh ngn ng C, bi vy ngi dng
khng mt nhiu th gi hc hi khi nm bt c nhng vn c bn ca mt
s ngn ng lp trnh thng dng.
Tip theo, Matlab khng ch cho php t vn tnh ton m cn c th x
l d liu, biu din ho mt cch mm do, n gin v chnh xc trong khng
gian 2D cng nh 3D, k c kh nng to hot cnh cho nhng m t sinh ng,
bi nhng cng c nh cc th vin chun, cc hm c sn cho cc ng dng a
dng, cc tp lnh ngy cng c m rng bi 25 th vin tr gip (Toolbox) v
bn thn cc hm ng dng c to lp bi ngi s dng. Khng cn kin thc
nhiu v my tnh cng nh k thut lp trnh c tnh xo thut, m ch cn n

61

nhng hiu bit c bn v l thuyt s, ton

ng dng, phng php tnh v kh nng lp
trnh thng dng, ngi s dng c th
dng Matlab nh mt cng c hu hiu cho
lnh vc chuyn ngnh ca mnh.
Sau ht, vic ci t Matlab tht l d
dng. Ta ch cn ch i cht nu mun
dng thm cc th vin tr gip nh Simulink, FLT, DSI Digital Signal
Processing hay mun tch hp phn mm ny vi mt vi ngn ng quen thuc ca
ngi s dng nh C, C++, Fortran
Matlab ngy nay tr nn thng dng v l mt cng c tr gip hu hiu
cho cc nh chuyn mn, nhng sinh vin ang theo hc trong cc trng i hc
v trung hc chuyn nghip, cc k s, cc cn b k thut nhm gii quyt cc
vn rt a dng trong cng vic thng ngy ca h.
Matlab c iu khin bi cc tp lnh, tc ng qua bn phm. N cng
cho php mt kh nng lp trnh vi c php thng dch lnh cn gi l Script
file. Cc lnh hay b lnh ca Matlab ln n hng trm v ngy cng c m
rng bi cc phn ToolBox (th vin tr gip) hay thng qua cc hm ng dng
c xy dng t ngi s dng. FLT l mt phn m rng ca Matlab, s dng
m phng cc h thng M mt cch nhanh chng v tin li.

4.2. B cng c Logic M (Fuzzy logic toolbox)

4.2.1. Gii thiu
B cng c Logic m (Fuzzy Logic Toolbox FLT) cung cp cho ngi s
dng mt h thng thit k v phn tch da trn logic M. N c y cc phin
ca qu trnh suy din, bao gm nh : pht trin, nghin cu, thit k, m phng v
suy din tnh ton. Giao din ho vi ngi s dng (GUI) cung cp mt mi
trng trc quan hng dn ngi s dng tng bc thit k h suy din M.
Nhiu phng php ca Logic M cung cp cho ngi dng thng qua cc hm
nh phng php phn lp v luyn mng nron.
Trong Matlab FLT cho php to v hiu chnh cc h suy din M. Ngi s
dng c th d dng s dng cc cng c ho hay cc hm trc tip t ca s

62

lnh to xy dng h suy din, hoc ngi s dng cng c th to chng t

ng bng cch s dng hoc k thut phn cm hoc Adaptive - k thut M n
ron.
GUI (Graphical User Interfaces) GUIs trong FLT cho php ta thit lp hai
kiu h thng m :
- H suy din M (FIS - Fuzzy Inference System):
Suy din M l mt phng php thng dch gi tr ca vc t u vo, da
trn cc lut c nh ngha xc nh gi tr ca cc vc t u ra. FLT cung
cp cho ta mt tp hp cc trnh son tho GUI cho php xy dng mt FIS. Cc
trnh son tho v quan st c s dng xy dng tp lut, xc nh hm thuc
v phn tch hot ng ca FIS.

Hnh 4.1: Ca s son tho phn lp M- Neuron thch nghi

- H suy din M - Neuron thch nghi (Adaptive neuron - Fuzzy Inference
System - ANFIS): y l giao din ho tch ring cung cp chc nng cho vic
phn nhm M. ANFIS cho php ta nh dng hm thuc da vo vic hun luyn
cc d liu u vo bng my tnh. ANFIS ch s dng thut ton lan truyn ngc
hoc n kt hp cng vi phng php bnh phng cc tiu. iu ny cho php
h M hc t tp d liu m c thit k.
Ngoi ra, ngi s dng c th kim tra h thng M ca mnh bng vic m
hnh ho trong cng c Simulink.
iu c bit ca FLT l c tnh M, cho php d dng hiu chnh cu trc
ca h suy din M. Do FLT c thit k cho php ngi s dng c th t to

63

cc hm ph hp theo h thng ca ring mnh di dng cc hm ca Matlab, v

c th thay th cho cc hm c thit k sn trong Matlab. C th nh l FLT cho
php ngi s dng hiu chnh cc hm thuc, cc php ko theo, cc ton t logic
AND hoc OR, php kt nhp v php gii M.

Hnh 4.2: H thng suy din M c thit k bng Simulink

B th vin cng c cng cho php ngi s dng vit chng trnh trc tip
bng ngn ng lp trnh cp cao C mt cch trc tip m khng cn Simulink (m
hnh ho).
Nh tnh m ca mi trng lm vic Matlab, cho php ngi s dng c
th to ra cc cng c ring cho FLT hay tch hp vi cc b th vin cng c
khc, v d nh: H thng iu khin (Control System),Mng Nron (Neuron
Network) B cng c ti u ho (Optimization Toolbox)
Kh nng m hnh ho cc quan h phc tp nh l mt tp cc lut n gin
lm cho logic M tr thnh mt phng php m hnh ho v iu khin cc h
thng phc tp, phi tuyn. Khi vic th hin m hnh ton hc ca mt h thng l
khng th c th FLT cho php ngi s dng s dng tp lut m t cc hot
ng ca h thng. Cc lut ny s dng php ko theo trong h suy din M
to ra m hnh M ca h thng. Ging nh cc th vin khc ca Matlab, FLT c
th tu bin. Ngi s dng c th dng hiu chnh m ngun, thut gii hay
thm vo cc hm thuc, php ko theo, php gii M ring. Hoc l ngi s
dng cng c th s dng th vin nh l m t suy din ring bit. Mt khc, ta c
th to ra cc khi cng vic bn trong cng c Simulink, cho php ngi s dng
m phng h thng M trong phm vi m hnh vt l ton din ca h thng. Ta c

64

th s dng Real-Time Workshop to ra m ngun file C, c th c s dng

cho xPC Target hay dng cho mc ch x l tc php ton du phy ng. FLT
trong Matlab gii quyt c cc vn nh:
- To v son tho cc h thng suy din M bng cc cch:
+ Thng qua giao din ngi s dng ho: GUI
+ Dng cc khi dng lnh
+ Cho php tch hp h thng M (suy din M) vi cng c Simulink
+ Xy dng suy din M bng cng c C (gi t ngn ng lp trnh C n
Matlab).

4.2.2. Cc tnh nng c bn ca FLT

- H tr vic tu bin cc lut v hm thuc to ra h suy din M.
- B GUIs (giao din ho vi ngi s dng ) ring vn dng cho cc
h thng ho, xem v phn tch kt qu tng tc.
- Xy dng h suy din chun kiu Mamdani v Sugeno
- S quyt nh ca cc hm thuc chun thng qua k thut luyn mng
neuron thch nghi v phn nhm M.
- Kh nng nhng mt h suy din M vo m hnh Simulink s dng khi
iu khin Logic M (Fuzzy Logic Controller).
- Kh nng to ra cc tp C mt cch linh ng thng qua Real-Time
Workshop.
- M t Logic M s dng m ngun file C cho php ta nh dng suy din
M mt cch c lp hoc nhng vo cc trnh ngoi tr khc.

4.2.3. Xy dng h suy din bng GUI ca FLT

Trong FLT, h suy din M gm 5 phn: M ho bin vo, p dng cc ton
t M cho cc gi thit, p dng php ko theo cho tng gi thit n kt qu, gp
cc kt qu bng b lut v gii M.
Trong mi tng Matlab, mt h thng suy din M hon chnh cung cp
cho ta 5 phn:

65

Hnh 4.3: M hnh cu trc GUI trong Matlab

- B son tho (FIS Editor): hin th cc thng tin chung v mt h suy din
M: bao nhiu bin vo, bao nhiu bin ra, tn cc bin. FLT khng gii hn s
lng bin vo, tuy nhin, s lng bin vo phi ph thuc vo b nh cho php
ca my tnh. Nu s lng bin vo qu ln hoc s lng hm thnh vin qu
nhiu th c th kh phn tch khi s dng cng c GUI.
- B son tho hm thuc (Membership function Editor) c s dng
nh ngha dng ca cc hm thuc ng vi tng bin.
- B son tho lut (Rule Editor) dng son tho danh sch cc lut - xc
nh hnh trng ca h thng.
- Quan st lut v quan st b mt c s dng quan st. Tri vi son
tho, y l cng c ch c. Quan st lut l l mt hnh nh c s ca Matlab hin

66

th th suy din M trong giai on sau cng. N c th ch ra hot ng ca cc

lut, ch ra nh hng ca cc hm thuc nh th no i vi kt qu tr v. Quan
st b mt cho php hin th c lp mt bin ra v mt hoc hai bin vo

4.2.4. Cu trc ca h suy din m trong Matlab

Cu trc ca FIS (Fuzzy Inference System) l mt i tng ca Matlab

trong bao gm tt c cc thng tin v h suy din. Cu trc ny c lu tr bn
trong mi cng c GUI. Cc hm truy nhp nh l getfis, setfis s cho ta d dng
kim tra cu trc ny. Ta cng c th ly cc thng tin ca mt cu trc Fis bng
cch s dng c php structure.field.
Mi thng tin ca mt h suy din a ra c cha ng trong cu trc FIS
bao gm nh tn bin, hm thuc xc nh Ta c th xem m hnh ca cu trc
FIS trong b cng c Logic m bao gm cc thnh phn nh sau:
FIS
name
type
andMethod
orMethod
defuzzyMethod
impMethod
aggMethod
input
output
rule

Input
name
range
mf
Output
name
range
mf
Rules
antecedent
consequent
weight
connections

Input 1 MFs
name
type
params
Input 2 MFs
name
type
params
Output MFs
name
type
params

Hnh 4.4: Cu trc FIS

Bn cnh cch xy dng h suy din m da vo b cng c giao tip vi
ngi s dng GUI mt cch thun tin th b cng c Logic M cng cung cp
cho ngi s dng cc hm, lnh truy nhp v lm vic trc tip t ca s lnh
ca Matlab.

67

4.3. Bi ton v d v ci t th thut ton 1, 2

4.3.1. Bi ton iu khin tn hiu n giao thng
iu khin v kim sot giao thng thnh ph ang tr thnh mt vn ln
nhiu nc. Vi s lng ngy mt tng ca xe trn ng, B Giao thng vn
ti l c quan tm nhiu cch hoc bin php khc phc mi. Cc bin php
ang pht trin cc tuyn ng mi gia thnh ph; xy dng ng vng. V
d nh ng vng trong, vng gia ng b v ng vng ngoi; gii thiu xe
la thnh ph nh vn chuyn nhanh nh; hn ch xe ln trong thnh ph trong gi
cao im, v cng c th pht trin ca cc iu khin giao thng tinh vi v h
thng iu khin.
i vi bi ton iu chnh thi n xanh, ti ng t ng c nhiu
phng php c p dng [15], trong cc phng php tun theo logic c in
vn thng c dng hin nay l hai phng php:
- iu chnh theo thi gian: tc l i vi bi ton t ra ti cc ng t ng
c mc u tin nh nhau th vic iu chnh n s tu vo thi gian cao im
trn on ng m c th thm hoc bt thi gian n xanh, .
- iu chnh theo hng: tc l i vi cc ng t c phn bit mc u
tin. Vi hng c mc u tin cao th thi gian n xanh nhiu hn, v ngc
li. Bn cnh cng c xt thm v yu t thi gian cao im.
Ngoi ra, cn nhiu phng n cng kt hp vi nhiu cc yu t lin quan
hn nh khong cch rng ca ng t, Song c mt vn t ra l vic p dng
cc phng php trn nhiu khi rt bt li. Bi v vic thng k s liu lin quan
n bi ton trn tng ng t l khc nhau, dn n vic thng k khng chnh xc
do lm cho thi gian cht ti cc ng t nhiu. Vic tnh ton lng xe i li vo
gi cao im khng phi lun ng vi mi ngy trong tun hay vi mi ngy
trong nm c phng php nghin cu gii php cho cc vn trn l cc
chuyn gia p dng phng php thch nghi (adaptation). Trong phng php ny,
ngi ta khng c nh thi gian T n xanh nht nh, m bin T N l thi gian n
xanh mt thi im th N no , v T N khng phi l mt hng s. TN khc
nhau ph thuc vo lng xe thng qua mt s thi im trc n. Tc l thi

68

gian TN s c xc nh bng cch quan st k thi im trc . y cn gi l

phng n Markov.
Nu s dng phng php ny th vn phi tin hnh cc cng vic nh quan
st trc v dng cch thc nh tnh. Hn na, kh c th s dng tnh ton v
c lng cho nhiu yu t bt nh c th xy ra trong thc t nh: thi tit, gi
cao im, V vy, vic p dng phng php suy din m cho php lm vic vi
cc bin ngn ng, tnh ton theo mt xc xut ln s cho kt qu tt hn cc
phng php khc.
Bi ton lp h suy din iu chnh thi gian n xanh n ti ng t ng cao tc c ch u tin mt trong mt s tnh hung nh: lng xe t cc
hng ng, Ty, Nam Bc, thi tit, gi cao im dn n cn cc thut gii
suy din M. y l mt trong nhng v d thng thy trong nghin cu v p
dng cc thut ton suy din m c nhiu ngi quan tm.
Trc y, ngi ta p dng cc thut ton suy din dng Max-min
(Mandani) v Max-Prod (Sugeno) trong s dng cc t-chun, t-i chun thng
thng. Trong [15], Kok Khiang Tan v cc cng s gii thiu mt phn mm
thc hin mt h thng kim sot giao thng thng minh n s dng cng ngh
logic m c kh nng bt chc tr thng minh ca con ngi cho php iu khin
n giao thng. gii hn ca lun vn ny ch xin gii thiu li thit k bi ton
kim sot n giao thng v s dng b lut ci t th cho thut ton suy din
1 v 2 ( gii thiu trong chng III).

4.3.2. Tiu ch v rng buc

Gi s thit lp cc tiu ch cho h giao thng nh sau:
i) Ng t l bn ng giao nhau vi ng giao thng n t pha bc, ty,
nam v pha ng;
ii) Khi giao thng t pha Bc v di chuyn v pha Nam, giao thng t pha
Ty v ng dng li, v ngc li;
iii) Khng c quyn r tri;
iv) B iu khin logic m s quan st mt giao thng pha Bc v pha
Nam l mt bn v mt pha Ty v pha ng nh mt bn khc;

69

v) Ln xe ng - Ty c gi thit nh l cch tip cn chnh;

vi) Thi gian ti thiu v ti a ca n mu xanh l 2 giy v 20 giy tng
ng.

4.3.3. Thit k b iu khin giao thng m

Mt b iu khin logic m c thit k cho mt ng 4: bc, nam, ng v
ty nh trong hnh.

Trong iu khin n giao thng hai bin u vo m c la chn: lu

lng xe bn n (Arrival) v s lng xe bn hng i (Queue). Nu pha bc v
pha nam l mu xanh l cy th hng ny s l Arrival trong khi bn pha ty v
pha ng s c coi nh l Queue v ngc li. Bin ra m bin s l gia hn
thi gian cn thit cho nh sng mu xanh l cy bn n (Extension). Nh vy
da trn cc iu kin giao thng hin ti ca cc lut m c th c xy dng sao
cho u ra ca b iu khin m s ko di hoc khng ko di thi gian ca n
mu xanh. Nu khng c gia hn thi gian trng thi n xanh hin ti, n giao
thng ngay lp tc s thay i sang pha khc.
4.3.3.1. Hm thuc ca bin vo v bin ra
Vi b iu khin tn hiu n giao thng, c 4 hm thuc cho mi bin vo
v ra ca h thng. Bng sau ch ra cc bin m ca cc bin Arrival, Queue v
Extention, s dng ch ci u vit tt cho cc bin m.
Arrival

Queue

Extention

Almost

AN

Very small

VS

Zero

Few

Small

Short

Many

MY

Medium

Medium

Too many

TMY Large

Longer

70

Biu din hnh hc cho cc hm thuc ca bin vo trong hnh:

Hnh 4.5: Hm thuc bin m ca bin vo Arrival

Hnh 4.6: Hm thuc bin m ca bin vo Queue

Hnh 4.7: Hm thuc bin m ca bin ra Extention

Trc y biu din cho gi tr thuc ca mi bin m. i vi cc bin vo
m trn trc x l mt tn hiu cm bin s lng xe. Vi bin ra l chiu di thi
gian c ko di trong vi giy. Thit k cho cc hm thuc ny c thc hin
theo quan st ca cc chuyn gia h thng v mi trng. Tuy nhin, rng v

71

trng tm ca cc hm thuc c th d dng thay i v thit k li theo cc iu

kin v trng thi giao thng khc nhau.
V d nu ng giao nhau l qu tc nghn, s lng xe t trong tp con
m "Qu nhiu" hay "ln" l cn c tng ln. Mt khc, ng giao nhau rng
v t nghn th chiu rng hm thuc c th c gim bt... Ta c th quan st
thy rng trong iu khin logic m s chuyn i t mt tp con m khc c
thc hin d dng t mt hnh ng kim sot ny sang hnh ng khc, v th, cn
c nhng nhng tp con m trng nhau. Nu khng c s chng cho trong cc tp
con m th cc hnh ng kim sot s b tng t nh iu khin hoa tri hai (iu
khin tng bc). Mt khc nu c qu nhiu chng cho trong cc tp con m, s
c rt nhiu vic m ha v iu ny lm nhiu cc hnh ng iu khin
4.3.3.2. B lut m
C ch suy din trong cc b iu khin logic m kh ging vi qu trnh
lp lun ca con ngi. Da vo kin cc chuyn gia trong vic kim sot lu
lng nhiu hn hoc t hn ta c dng lut theo cch sau:
IF giao thng t pha bc ca thnh ph l NG
AND giao thng t pha ty l VNG
THEN thi gian cho php chuyn ng giao thng t pha bc l DI.
Hoc 1 lut khc:
IF giao thng t pha bc ca thnh ph l TRUNG BNH
AND giao thng t pha ty l TRUNG BNH
THEN cho php chuyn ng ca c 2 bn l BNH THNG
im mnh ca logic m l c th s dng cc l lun gn ng trong cc
quy tc nh NG, VNG, TRUNG BNH, BNH THNG, DI, v.v. Da
vo thit k cc hm thuc m, cc bin nh ngn ng, mc d m trong t nhin,
nhng vn c th thc hin trong my tnh thng qua cng ngh logic m.
Trong pht trin b iu khin logic m, chng ta s dng cc lut tng t
nh mt s v d c a ra di y:
Nu c qu nhiu xe t (TMY) pha bn n v rt nh, s lng xe t
(VS) xp hng th thi gian thm cho n mu xanh l di (L).

72

Nu c hu nh khng c xe t (AN) pha bn n v rt nh s lng

xe t (VS) bn i th khng thm thi gian n mu xanh (Z).
Cc lut ny c th c rt ngn nh sau:
Nu ARIVAL l TMY v QUEUE l VS THEN Extension l L
NU ARIVAL l F v QUEUE l VS THEN Extension l S
NU ARIVAL l AN v QUEUE l VS THEN Extension l Z
Trong "ARIVAL" v "QUEUE" l nhng gi thit v "Extention" ca n
xanh l kt lun. Cc lut ny c th d dng pht trin theo cc iu kin giao
thng ti ng t v n gin ta biu din cc quy tc ny trong mt ma trn:
ARIVAL

QUEUE

AN

MY TMY

VS

Tng ng vi ma trn lut trn cho ta b 16 lut iu khin tn hiu n

giao thng trong h suy din m:
1. If (Arival is AN) and (QUEUE is VS) then (Extention is Z)
2. If (Arival is AN) and (QUEUE is S) then (Extention is Z)
3. If (Arival is AN) and (QUEUE is M) then (Extention is Z)
4. If (Arival is AN) and (QUEUE is L) then (Extention is Z)
5. If (Arival is F) and (QUEUE is VS) then (Extention is S)
6. If (Arival is F) and (QUEUE is S) then (Extention is S)
7. If (Arival is F) and (QUEUE is M) then (Extention is Z)

73

8. If (Arival is F) and (QUEUE is L) then (Extention is Z)

9. If (Arival is MY) and (QUEUE is VS) then (Extention is M)
10. If (Arival is MY) and (QUEUE is S) then (Extention is M)
11. If (Arival is MY) and (QUEUE is M) then (Extention is S)
12. If (Arival is MY) and (QUEUE is L) then (Extention is Z)
13. If (Arival is TMY) and (QUEUE is VS) then (Extention is L)
14. If (Arival is TMY) and (QUEUE is S) then (Extention is M)
15. If (Arival is TMY) and (QUEUE is M) then (Extention is M)
16. If (Arival is TMY) and (QUEUE is L) then (Extention is S)
Thit k h suy din vi b lut trn y vo FLT, cu trc FIS dng
Mamdani thut ton 1 - sau khi thit k c ni dung:
Name

= traffic

Type

= mamdani

NumInputs = 2
InLabels =
Arival
QUEUE
NumOutputs = 1
OutLabels =
Extention
NumRules = 16
AndMethod = min
OrMethod = max
ImpMethod = min

74

AggMethod = max
DefuzzMethod = centroid
cho ta kt qu biu din bng hnh hc nh trong hnh 4.8.

Hnh 4.8: Biu din hnh hc ca h suy din dng Mamdani

Vi h suy din trn, nu p dng phng php lp lun logic thut ton 2,
kt qu xc nh mc t ca mi lut v vic tch hp cc tp m u ra khc i s
cho kt qu nh sau:

Hnh 4.9: Biu din hnh hc ca h suy din dng lp lun logic

75

76

KT LUN
Sau thi gian nghin cu v thc hin n, di s hng dn tn tnh ca
thy gio PGS.TSKH. Bi Cng Cng, em hon thnh yu cu ca lun vn
tt nghip l tm hiu cc php ton c bn ca logic m ni chung v mt s quy
trnh suy din m ni ring. Lun vn c tp trung m rng tm hiu cc
phng php lp lun xp x trong h m da trn c s cc lut m, trong h
m dng TSK l mt m hnh c tm hiu c nhiu u im v tnh nng mi.
hon thnh ti trn, em thc hin: nghin cu cc ti liu c lin
quan n ti (xem danh mc ti liu tham kho); Tham gia sinh hot Xemina ti
Vin Ton hc H ni; Nghe cc bui chuyn ti khoa Ton ng dng, i hc
Bch Khoa H Ni; Tham d hi tho trng thu "H m v ng dng" ln th
1,2,3 ti H Ni; Tham kho nghin cu s dng phm mm Matlab Mt phn
kt qu t nhng nghin cu bc u ny c trnh by trong 03 bi bo (xem
danh mc cng trnh ca tc gi).
T cc kt qu nghin cu ny cho php a cc thut ton suy din ci t
vo trong cc b iu khin m, khng cn kho st li cc c tnh ton hc chung
ca thut ton na m ch phi xt ti cc c im ring ca bi ton thc t. Cc
thut ton ny c th c kt hp vi mng n-ron m hoc a vo cc ng dng
tr tu nhn to (nh h chuyn gia, h h tr quyt nh, ...) gip cho h thng suy
din cho mt kt qu ng n v chnh xc hn, ph hp vi yu cu ca ngi
chuyn gia v yu cu thc t ca h thng suy din. Cc thut ton ny khi dng
b cng c Simulink ca Matlab c th c s dng ci t vo b iu khin
vi cc senso nhn tn hiu iu khin bn ngoi nh cc bin u vo v cc gi tr
ngng. y l mt ng dng c rt nhiu chuyn gia trong cc ngnh in t,
cng ngh thng tin qua tm.
Tuy vy, phn ln cc kt qu t c trong qu trnh nghin cu mi ch
dng li mc l thuyt v th nghim. c th p dng c trong thc t
th cn cn phi kho st, phn tch k v m hnh ho i vi tng bi ton c th.
y chnh l bc pht trin tip theo ca ti m do hn ch v thi gian thc
hin v kin thc ca tc gi nn cn cha c trin khai. Ngoi ra, m rng b
sung b cng c Logic M v kt hp vi b cng c Neuron Network Toolbox
trong Matlab s l hng pht trin tip theo ca ti, vi mong mun to ra c
cc b iu khin, ng dng suy din M vo trong nhiu lnh vc ca khoa hc v
k thut.

77

DANH MC CNG TRNH CA TC GI

1. Bi Cng Cng v H Khnh L Mt s thut ton suy din m v b cng
c Logic M ca Matlab (phn I) Preprint 2002/17. Vin Ton hc H Ni,
05/2002.
2. Bui Cong Cuong, Nguyen Hoang Phuong, Ho Khanh Le, Bui Truong Son and
Le Quang Phuc - Adding some new fuzzy Inference Methods to Fuzzy Logic
Toolbox of Matlab. In Proceeding of the Third International conference on
Intelligent technologies and Third Vietnam Japan Symposium on Fuzzy Systems
and Applications, INTECH/VJFUZZY2002, CNRS, 2002, pp 143-148.
3. Bui Cong Cuong, Nguyen Hoang Phuong, Ho Khanh Le, Bui Truong Son, and
Koichi Yamada (2003) - Fuzzy Inference Methods Employing T-norm with
threshold and their Implementation, J. Advanced computational Intelligence and
Intel. Informatics 7(2003), N03, pp 362-369.

78

TI LIU THAM KHO

Ting Vit
1.

Bi Cng Cng v Nguyn Don Phc (2001), H M, mng Neuron v

ng dng, NXB Khoa hc K thut, H Ni, 2001.

2.

Bi Cng Cng (2000), Kin thc c s ca H M, Trng thu H M v

ng dng ln th nht, Vin Ton hc, H Ni, 8/2000.

3.

Bi Cng Cng v H Khnh L (2002), Mt s thut ton suy din m v

b cng c Logic M ca Matlab (phn I) , Preprint 2002/17, Vin Ton hc
H Ni, 05/2002.

4.

ng Minh Hong (2000), ha vi Matlab5.3, NXB Thng k, TPHCM,

2000

5.

H Khnh L (2002), Bc u tm hiu v ci t b sung b cng c Logic

M ca Matlab, n tt nghip, Khoa cng ngh tin hc, Vin i hc M
H Ni, 2002.

6.

Phm Vn Li (2001), Mt s dng suy rng ca php hi, php tuyn, php
ko theo trong logic m v mt vi ng dng, Lun vn Thc s ton hc, Vin
ton hc, 2001.

7.

Phan Xun Minh, Nguyn Don Phc (1997), L thuyt iu khin M, NXB
Khoa hc v K thut, H Ni, 1997.

8.

Nguyn Hong Phng, Bi Cng Cng, Nguyn Don Phc, Phan Xun
Minh v Chu Vn H (1998), H M v ng dng, NXB Khoa hc K thut,
H Ni, 1998.

9.

Nguyn Trng Thun (2000), iu khin Logic v ng dng, tr. 119-181,

NXB Khoa hc v K thut, H Ni, 2000

10. Nguyn Hu Tnh, L Tn Hng, Phm Th Ngc Yn, Nguyn Th Lan

Hng (2001), C s Matlab v ng dng, NXB Khoa hc K thut, H Ni,

2001.
Ting Anh
11. Bui Cong Cuong (2002) Some Computing Procedure in Fuzzy System The Proceeding of the school on Scientific Computing and Applications, March
4-6, 2002, HCM University Technology, pp. 117-127.
12. Bui Cong Cuong, Nguyen Hoang Phuong, Ho Khanh Le, Bui Truong Son and
Le Quang Phuc (2002), Adding some new fuzzy inference methods to

79

Fuzzy Logic Toolbox of Matlab, Proceeding of the Third International

conference on Intelligent technologies and Third Vietnam Japan Symposium
on Fuzzy Systems and Applications, INTECH/VJFUZZY2002, CNRS, 2002,
pp 143-148.
13. Bui Cong Cuong, Nguyen Hoang Phuong, Ho Khanh le, Bui Truong Son, and
Koichi Yamada (2003), Fuzzy inference methods employing T-norm with
threshold and their implementation, J. Advanced computational Intelligence
and Intel. Informatics, 7(2003), N03, pp 362-369.
14. Duane Hanselman, Bruce Littlefield (1996) Mastering Matlab 5
International Edition, 1996.
15. Jyh-Shing, Joger Jang (1993), ANFIS: Adaptive - network based fuzzy
inference system, IEEE transactions on systems, Man, and Cybernetic, Vol.
23, No. 3, May-June 1993.
16. Kok Khiang Tan, Marzuki Khalid and Rubiyah Yusof (1996), Intelligent
traffic lights control by fuzzy logic, Malaysian Journal of Computer Science,
Vol. 9 No. 2, December 1996, pp. 29-35. ISSN 0127-9084.
17. Matlab Graph (Users guide).
18. Nobuyuki NAKAJIMA (2001) , Fuzzy logics and t-norms, Proceeding of
the second Vietnam-Japan Symposium on Fuzzy Systems and Applications.
VJFUZZY2001, pp. 34- 39.
19. Sugeno, M. and Kang, G. T (1986). Fuzzy modeling and control of
multilayer incinerator, Fuzzy Sets and Systems, Volume 18 , Issue 3 ,
Elsevier North-Holland (April 1986), pp. 329-346.
20. Ronald R.Yager and Dimitar P.Filev (1998), Sugeno, M. and Nguyen H. T.
(Eds), Fuzzy rule based models and apprroximate reasoning, Fuzzy system:
modelling and control, Kluwer Academic, Boston 1998, pp. 91-133.
21. Ronald R. Yager, Dimitar Filev (1993), On the issue of defuzzification and
selection based on a fuzzy set, Fuzzy Sets and Systems, Volume 55, Issue 3,
Elsevier North-Holland, 10 May 1993, pp. 255-271.