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

H Ni 2009

MC LC
 ii

Trang
Trang ba ph
LI CAM OAN Error! Bookmark not defined.
LI CM N Error! Bookmark not defined.
MC LC i
BNG K HIU CC CH VIT TT iv
DANH MC CC BNG iv
DANH MC CC HNH V, TH iv
M U 6
CHNG I - C S LOGIC M 8
1.1. Logic r v s xut hin ca logic m ....................................................................... 8
1.2. Cc php ton v tp m ............................................................................................ 9
1.2.1. Php ph nh .................................................................................................... 9
1.2.2. T - chun ............................................................................................................ 9
1.2.3. T - i chun .................................................................................................... 14
1.3. Mt s vn lin quan ca cc ton t trong Logic M ....................................... 18
1.3.1. Php i ngu .................................................................................................. 18
1.3.2. Quan h gia t - chun v t - i chun. ....................................................... 19
1.3.3. Mt s qui tc vi php hi v php tuyn ................................................... 19
1.4. Php ko theo ........................................................................................................... 20
1.4.1. nh ngha php ko theo ............................................................................... 20
1.4.2. Mt s dng hm ko theo c th .................................................................. 22
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 ...................................................................................................... 27
1.5.2. Php hp thnh ............................................................................................... 27
CHNG 2 LUT M V H SUY DIN M Error! Bookmark not defined.
2.1. H m trn c s cc lut m .................................. Error! Bookmark not defined.
2.1.1. nh ngha lut m ............................................. Error! Bookmark not defined.
2.1.2. nh ngha h m trn c s cc lut m ......... Error! Bookmark not defined.
2.2. H suy din m ........................................................ Error! Bookmark not defined.
2.2.1. Kin trc c bn ca h suy din m ................ Error! Bookmark not defined.
2.2.3. Cc bc suy din m ......................................... Error! Bookmark not defined.
2.2.4. Mt s phng php suy din trong h m ...... Error! Bookmark not defined.
CHNG III - LP LUN XP X TRONG H M TRN C S CC LUT M Error!
Bookmark not defined.
3.2. M hnh ngn ng - Linguistic models (LM) .......... Error! Bookmark not defined.
3.3. Suy din vi m hnh m ......................................... Error! Bookmark not defined.
3.4. M hnh Mamdani (Constructive) v Logical (Destructive) ..Error! Bookmark not
defined.
3.4.1. Phng php lp lun Mandani ........................ Error! Bookmark not defined.
3.4.2. Phng php lp lun logic ................................ Error! Bookmark not defined.
3.5. M hnh ngn ng vi tp hp cc u ra ............... Error! Bookmark not defined.
3.6. M hnh Takagi Sugeno Kang (TSK) ................ Error! Bookmark not defined.
3.6.1. M hnh ................................................................ Error! Bookmark not defined.
 iii

3.6.2. Mt s v d m hnh TSK n gin ................. Error! Bookmark not defined.

CHNG 4 B CNG C LOGIC M CA MATLAB V CI T TH THUT
TON Error! Bookmark not defined.
4.1. Gii thiu chung mi trng MATLAB ................. Error! Bookmark not defined.
4.2. B cng c Logic M (Fuzzy logic toolbox) .......... Error! Bookmark not defined.
4.2.1. Gii thiu.............................................................. Error! Bookmark not defined.
4.2.2. Cc tnh nng c bn ca FLT .......................... Error! Bookmark not defined.
4.2.3. Xy dng h suy din bng GUI ca FLT ........ Error! Bookmark not defined.
4.2.4. Cu trc ca h suy din m trong Matlab ...... Error! Bookmark not defined.
4.3. Bi ton v d v ci t th thut ton 1, 2 ............ Error! Bookmark not defined.
4.3.1. Bi ton iu khin tn hiu n giao thng ..... Error! Bookmark not defined.
4.3.2. Tiu ch v rng buc .......................................... Error! Bookmark not defined.
4.3.3. Thit k b iu khin giao thng m ............... Error! Bookmark not defined.
KT LUN Error! Bookmark not defined.
DANH MC CNG TRNH CA TC GI Error! Bookmark not defined.
TI LIU THAM KHO 29
 iv

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 11
Hnh 1.2: th t-chun Lukasiewiez 11
Hnh 1.3: th t-chun T2 12
Hnh 1.4: th t-chun t(x,y) = x*y 12
Hnh 1.5: th t-chun min 12
Hnh 1.5: th t-chun Min-Nilpotent 12
Hnh 1.6: th t-chun T4 13
Hnh 1.7: Giao ca 2 tp m dng tch 14
Hnh 1.8: Giao ca 2 tp m dng min 14
Hnh 1.8: th hm t-i chun SN 16
Hnh 1.9: th T-i chun SM 16
Hnh 1.10: th T-i chun SP 16
Hnh 1.11: th T-i chun S2 16
Hnh 1.13: th T-i chun S4 16
Hnh 1.14: th T-i chun SL 17
Hnh 1.15: th T-i chun S0 17
Hnh 1.16: Hp ca hai tp m dng Max 18
Hnh 1.17: Hp ca hai tp m dng Lukasewiez 18
Hnh 1.18: th IQL= 1-x+x2y 24
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 26
Hnh 1.22: th hm I(x,y) - Goguen 27
Hnh 2.1: ng c iu khin tc khng kh. Error! Bookmark not defined.
Hnh 2.2: Cu trc c bn ca h suy din m Error! Bookmark not defined.
Hnh 2.3: Gii m bng phng php cc i Error! Bookmark not defined.
Hnh 2.4: Gii m bng phng php trung bnh Error! Bookmark not defined.
Hnh 2.5: Gii m theo phng php trung bnh tm Error! Bookmark not defined.
 v

Hnh 2.6: Hm thuc hp thnh dng i xng Error! Bookmark not defined.
Hnh 2.7: Gii m trung bnh tm vi m=2 Error! Bookmark not defined.
Hnh 3.1: Phn phi kt hp lut R1(x,y): IF U l Bi THEN V l Di Error! Bookmark not
defined.
Hnh 3.2: Phng php lp lun Mamdani/Constructive Error! Bookmark not defined.
Hnh 3.3: Kt qu tnh ton u ra bng hnh phng php Mamdani Error! Bookmark
not defined.
Hnh 3.4: S khi ca phng php lp lun lgic Error! Bookmark not defined.
Hnh 3.5: Tnh ton kt qu u ra bng hnh ca phng php logic Error! Bookmark
not defined.
Hnh 3.6: Biu din cc quan h m R tng ng vi phng php Mamdani Error!
Bookmark not defined.
Hnh 3.7: S khi ca c ch suy din n gin Error! Bookmark not defined.
Hnh 3.8: Biu din hnh hc ca h suy din v d 2 Error! Bookmark not defined.
Hnh 4.1: Ca s son tho phn lp M- Neuron thch nghi Error! Bookmark not
defined.
Hnh 4.2: H thng suy din M c thit k bng Simulink Error! Bookmark not
defined.
Hnh 4.3: M hnh cu trc GUI trong Matlab Error! Bookmark not defined.
Hnh 4.4: Cu trc FIS Error! Bookmark not defined.
Hnh 4.5: Hm thuc bin m ca bin vo Arrival Error! Bookmark not defined.
Hnh 4.6: Hm thuc bin m ca bin vo Queue Error! Bookmark not defined.
Hnh 4.7: Hm thuc bin m ca bin ra Extention Error! Bookmark not defined.
Hnh 4.8: Biu din hnh hc ca h suy din dng Mamdani Error! Bookmark not
defined.
Hnh 4.9: Biu din hnh hc ca h suy din dng lp lun logic Error! Bookmark not
defined.
 6

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
 7

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.
 8

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:
Nh vy, im 1,6m l im ti hn ra quyt nh, c 1,6m tr ln l thuc loi
ngi cao, cn di 1,6m l loi ngi thp.
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 1.6m
r, logic m, chng hn:
Anh ny trng rt cao.
C ny trng c y. Loi Nhn
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 :
 9

- 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.
1 x
- H ph nh (Sugeno) N ( x) , 1 . Vi h Sugeno ny ta c mnh
1 x
sau:
* 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 ) .
(1 x) (1 x)
Hn na, N ( N ( 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
 10

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, 12 0, 1 l mt t - chun (t-norm), khi v ch khi tho cc iu kin
sau:
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) =
0 khi max{x, y} 1
2) T - chun LukasiewiczTL (x, y) = max(0, x+y-1)
xy
3) T2(x, y)=
2 ( x y xy )
4) Dng tch TP (x, y) = x.y
xy
5) T4(x, y) =
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) =
0 khi x y 1
* 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
 11

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:
xy
1) T2 (x, y) = 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)=
0 khi max{x, y} 1

Hnh 1.2: th t-chun yu nht T0

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

Hnh 1.2: th t-chun Lukasiewiez

 12

xy
T2(x, y) = .
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)=
0 khi x y 1

Hnh 1.5: th t-chun Min-Nilpotent

 13

xy
T4(x, y) =
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(a).B(a)
( A p 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].
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 t1, 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:
 14

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).
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.
x y 2 xy
3) S2(x, y) = .
1 xy
x y
4) S4(x, y) = .
1 xy
 15

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

max{x, y} khi (x y ) 1
6) SN(x, y) = max1(x, y) =
0 khi (x y ) 1
max{x, y} khi min(x, y ) 0
7) S0(x, y) =
0 khi min(x, y ) 0
* nh l 1.10:
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

max{x, y} khi (x y ) 1
SN(x, y)=
0 khi (x y ) 1
 16

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

x y 2 xy
S2(x, y)=
1 xy

Hnh 1.11: th T-i chun S2

x y
S4(x, y) =
1 xy

Hnh 1.13: th T-i chun S4

 17

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)=
0 khi min(x, y ) 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:
(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,
(q ) A(a).B(a) A(a) B(a)
( A q 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(a) B(a) A(a).B(a) min{ A(a), B(a), (1 t )}
( A t B)(a)
max{(1 A(a)),(1 B(a)),t}
 18

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

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).
 19

- 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.
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
maxx + y - 1, 0 minx + y, 1
min0(x, y)= max1(x, y) =
min{x, y} vi (x y ) 1 max{x, y} vi (x y ) 1

0 vi (x y ) 1 0 vi (x y ) 1
Z(x, y) = Z(x, y) =
min{x, y} vi max(x, y ) 1 max{x, y} vi min(x, y ) 0

0 vi max(x, y ) 1 0 vi min(x, y ) 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.
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:
 20

Chng ta ni T l lu ng (idempotency) nu T(x, x) = x, vi x0, 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, y0, 1, v cng ni S l
lu ng khi v ch khi S(x, y) = max(x, y), vi x, y0, 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, y0, 1. (a)
S(T(x, y), x) = x, vi x, y0, 1. (b)
* Mnh 1.19:
(a) ng khi v ch khi T(x, y) = min(x, y), vi x, y0, 1,
(b) ng khi v ch khi S(x, y) = max(x, y), vi x, y0, 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.
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.
 21

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:
Php ko theo l mt hm s I: 0, 12 [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 P1 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, 12 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.
 22

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) = supu:T(x, u) y
* nh l 1.28:
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.
 23

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))
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:
 24

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:
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 c: max( y,1- x) 1 . Khi ta c IQL x, y max y, 1 x .
Hnh v nh sau:

0.5 1
z

0.8

0 0.6
0
0.2 0.4
0.4
0.6 0.2
0.8 y
1 0
x

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 :
IQL x, y S T x, y , n x
Z 0,1 x do min(0, 1-x)=0)
max(0,1 x) 1 x
+ 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
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
 25

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) ba 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)
* 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 c
f (0, 1)= lim f ( ,1 ) =lim 0 = 0. Tri vi (I0)
s0
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.
 26

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))

2) Godeh: Kt qu ca dng php ko theo dng IR vi T = min
1 nu x y
I(x, y) =
y nu x 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 nu x y
I(x, y) =
y nu x y
 27

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

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 XY nu R l mt
tp m trn XY, tc l c mt hm thuc R: X Y0, 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 XY, ta c nh ngha
1) Quan h R1 R2 vi R1R2(x, y) = max R1(x, y), R2(x, y), (x, y) XY.
2) Quan h R1R2 vi R1R2(x, y) = min R1(x, y), R2(x, y) (x, y) XY.
* 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 XY 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 XY, R2 l quan h m trn YZ. Hp thnh R1R2 ca
R1, R2 l quan h m trn XZ.
 28

a. Hp thnh max-min (max-min composition) c xc nh bi

R1oR2(x, z) = maxymin(R1(x, y), R2(y, z)), (x, z) X Z.
b. Hp thnh max-prod cho bi
R1oR2(x, z) = maxyR1(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) = maxyR1(x, y) * R2(y, z)(x, z) X Z.
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.
 29

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.
 30

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
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.