B GIAO THNG VN TI

TRNG I HC HNG HI
B MN: KHOA HC MY TNH
KHOA: CNG NGH THNG TIN




BI GING

H CHUYN GIA




TN HC PHN : H CHUYN GIA
M HC PHN : 17213
TRNH O TO : I HC CHNH QUY
DNG CHO SV NGNH : CNG NGH THNG TIN











HI PHNG - 2010
MC LC

NI DUNG TRANG
M u 1
Chng 1: Tng quan v h chuyn gia 2
1.1 H chuyn gia - chng trnh ng dng (HCG - CTD) 2
1.2 Cu trc h chuyn gia 4
1.3 ng dng h chuyn gia 5
Bi tp chng 1 6
Chng 2: Biu din tri thc 7
2.1 M u 7
2.2 D tha (Redundancy) 7
2.3 Mu thun (consistency - inconsistency) 11
2.4 Lu tr CSTT 14
2.5 Son tho tri thc 16
2.6 Cp nht sa i 16
Bi tp chng 2 17
Chng 3: Cc k thut suy din v lp lun 18
3.1 Nhp mn 18
3.2 Phn r CSTT 18
3.3 M t suy din 20
3.4 Biu din tri thc bng Logic v t v suy din 30
3.5 ng dng cc k thut suy din 32
Bi tp chng 3 37
Chng 4: H h tr quyt nh 38
4.1 Khi nim v h h tr ra quyt nh 38
4.2 Cu trc ca mt h h tr ra quyt nh 39
Bi tp chng 4 41
Chng 5: My hc 42
5.1 Th no l my hc 42
5.2 Hc bng cch xy dng cy nh danh 43
Bi tp chng 5 48
Chng 6: Logic m v lp lun xp x. 49
6.1 Biu din tri thc bng logic v t 49
6.2 Mt s v d 49
6.3 C ch suy din 50
6.4 Biu din tri thc bng logic m v suy din 52
Bi tp chng 6 63
cng n tp 64
thi mu 65

Tn hc phn: H chuyn gia . Loi hc phn : 3
B mn ph trch ging dy : Khoa hc my tnh Khoa ph trch: CNTT.
M hc phn: 17213 Tng s TC: 3

TS tit L thuyt Thc hnh/ Xemina T hc Bi tp ln n mn hc
60 45 0 0 15 0

iu kin tin quyt:
Sinh vin phi nm c mt ngn ng lp trnh v hc mn TTNT.
Mc tiu ca hc phn:
- Cung cp cc kin thc c bn v cc k thut biu din v x l tri thc.
- Rn luyn t duy khoa hc.
Ni dung ch yu:
- Tng quan v h chuyn gia;
- Biu din tri thc v lp lun;
- H h tr ra quyt nh.
- My hc;
- Logic m v lp lun xp x;
Ni dung chi tit:


Tn chng mc
Phn phi s tit
TS LT BT Xemina KT
M U
Chng I. H chuyn gia, chng trnh ng dng 08 08
1.1. H chuyn gia - chng trnh ng dng 03
1.2. Cu trc h chuyn gia 03
1.3. ng dng h chuyn gia 02
Chng II. Biu din tri thc 08 08
2.1. M u 01
2.2. D tha (Redundancy) 01
2.3. Mu thun (consistency - inconsistency) 01
2.4. Lu tr CSTT 02
2.5. Son tho tri thc 02
2.6. Cp nht sa i 01
Chng III. Cc k thut suy din v lp lun 09 08 01
3.1. Nhp mn 01
3.2. Phn r CSTT 02 01
3.3. M t suy din 01
3.4. Biu din tri thc bng Logic v t v suy din 02
3.5. ng dng cc k thut suy din 02
Chng IV. H h tr quyt nh 06 05 01
4.1. Khi nim v h h tr ra quyt nh 02
4.2. Cu trc ca mt h h tr ra quyt nh 03 01
Chng V. My hc 08 08
5.1. Th no l my hc 02
5.2. Hc bng cch xy dng cy nh danh 06
Chng VI. Logic m v lp lun xp x. 06 05 01
6.1. Biu din tri thc bng logic v t 01
6.2. Mt s v d 01 01
6.3. C ch suy din 01
6.4. Biu din tri thc bng logic m v suy din 02

Nhim v ca sinh vin: Ln lp y v chp hnh mi quy nh ca Nh trng.
Lm bi tp ln ng hn.
Ti liu tham kho:
1. Nguyn Thanh Thy - H Chuyn gia - Trng i hc Bch khoa H ni - 2002
2. Hong Kim - Cc h c s tri thc - Nh xut bn HQG TPHCM - 2002
3. JohnDurkin - Expert systems - NXB Prentic Hall - 1994
Hnh thc v tiu chun nh gi sinh vin:
- Thi vit rc phch, thi gian lm bi: 60 pht.
Thang im : Thang im ch A,B,C,D,F.
im nh gi hc phn: Z=0,3X+0,7Y.

Bi ging ny l ti liu chnh thc v thng nht ca B mn Khoa hc my tnh, Khoa
Cng ngh thong tin v c dng ging dy cho sinh vin.

Ngy ph duyt: / /2010


Trng B mn: (k v ghi r h tn)
1

M u
Ngy nay vic ng dng cng ngh k thut cao vo i sng ang l mt i hi
bc thit. Mt trong nhng lnh vc l tr tu nhn to, m mt phn quan trng
ca n l H chuyn gia. Vy h chuyn gia l g? Theo gio s Edward
Feigenbaum ca trng i hc STANFORD , ng l mt trong nhng chuyn gia
u ngnh v h chuyn gia cho rng: H chuyn gia l mt h thng chng
trnh my tnh cha cc thng tin tri thc v cc qu trnh suy din v mt lnh vc
c th no d gii quyt cc bi ton kh m di hi s uyn bc ca cc chuyn
gia trong ngnh. Mt cch khc ta c th thy:

H chuyn gia = CSTT + MTSD + GD + Modul hi p + Thu nhn tri thc
Cc vn ca h chuyn gia:
Qun tr tri thc
Mt - suy din:
Sd thng thng
Sd vi Metaknowledge
Sd khng chc chn
Sd xp x logic xc sut
Logic m
Giao din
Hi p
KDD : thu np (pht hin) tri thc t d liu
HCG phn tn






2

Chng 1: Tng quan v h chuyn gia
1.1. H chuyn gia - chng trnh ng dng (HCG - CTD)
Khi nim: H chuyn gia (HCG ) l mt chng trnh ng dng (CTD) khai
thc c s tri thc (CSTT) thu np t ngun tri thc chuyn mn da trn vic s
dng c ch suy din gii quyt cc bi ton t vn KH t trnh c nh
mt CHUYN GIA LU NM LNH NGH
i) Ta c s m t nh sau:
HCGD = CSTT + MTSD
(BDTT)
Ngun tri thc NSD

Chuyn gia Ti liu chuyn mn
Qua s trn ta c th thy: Mt chng trnh ng dng c xy dng da trn
CSTT v (MTSD) m t suy din. Trong CSTT c ly t ngun tri thc. C
hai loi l xin kin t cc chuyn gia trong lnh vc , cng c th ly theo cch
th hai l tng hp t cc ti liu chuyn mn. Cn MTSD ph thuc vo ngi
dng do ngi dng a ra .
ii) Vai tr ca k s tri thc (knowledge Engineer)
Lnh vc CM Tin hc
1. Xd HT
3
QL
Nh c/m
LTV
Analyzer
2. XD HCG
C gia
LTV
K s TT
SUPER
Super
c
SUPER

S
c
c
Super
Super
Super
c

c
Super
Super

iii) Xy dng h chuyn gia
3

Sau khi xt ai tr ca cc nhn t mc trn ta c th thy rng xy dng mt
h chuyn gia th cn c s tham gia ca cc nhn t. v s kt hp ca h tin hnh
trong mt thi gian di( long-term). Cc nhn t bao gm:
- CGia
- LTV
- K s tri thc
iv) Hai phng cch xy dng h chuyyn gia ng dng
Cch 1:
Vi cch ny c s kt hp v n lc gia cc chuyn gia, cc k s tri thc v cc
lp trnh vin. H lm vic cng nhau v kt qu l xy dng mt h chuyn gia.
HCGD = n lc (CGia + KSTT + LTV)
Cognitive Engineering
Cch 2:
Trong cch ny khng c s tham gia ca Lp trnh vin
HCGD = n lc (CGia + KSTT) + CNG C
ES Generation KBMS
Shell ES ES Building to
Empty ES
v) H tri thc(knowledge system)
Tri thc c thu np t nhiu ngun khc nhau nh l:
+Ti liu
+KDD
+Knowledge Base System
+Knowledge Base System : H thng lm vic trn c s tri thc
vi) H chuyn gia nhm gii quyt bi ton t vn (consultation) kh

vii) H chuyn gia phi t trnh cao

HTTTQL HCG
Nhiu thng tin t
4

Nhanh
Chnh xc
Chm SUPER cross - validation
KCX

1.2. Cu trc h chuyn gia
Phin t vn chuyn gia




(0) Phin thu np tri.thc : off - line
(1) Phin hi: ly thng tin
(2) Suy din On - line
(3) Gii p











user
TT(2) SD (3)
Expert



Tp tin (1)
Ngy, gi, thng, nm, gii tnh
Klun/ t vn (1)
C.Gia
NSD
Giao din (1)
M t suy din (3)
Cc c ch Cc c
s dng ch K
Son tho
tri thc
(5)
Gii thch
(4)
KDD

CS lut Cs s
l.vc kin
(NSD)
CSTT(2 )

CSDL
L
KSTT
5

Phn tch (If then)
HCG = 1 +(2 + 3) + 4 + 5 + 6
Kenel(nhn)
V d:
(1) nh c
i) CHNG TRNH C = CTDL + Thut gii Heuristic
ii) Cm nang
If th c Then i qun.....
(2) H T vi
(3) H khm bnh
1.3. ng dng h chuyn gia
Hin nay h chuyn gia c ng dng trong nhiu lnh vc khc nhau: v d nh
cng nghp, nng nghip, khoa hc my tnh, thng mi kh tng, y hc, qun s,
ho hc..... bit trong giai on gn y vic ng dng h chuyn gia vo lnh vc
gio dc o to ang c pht trin mnh.
u cn t vn c th xy dng h chuyn gia
nn
phi
* Cc dng bi ton (S t vn)
1 - Din gii (Interpretation): a ra m t tnh hung cc d liu thu thp
c.
2 - D bo (Hediction): a ra hu qu ca mt tnh hung no , nh l d
bo thi tit, d bo gi c th trng.
3 - Chun on (Diagnosis): Xc nh cc li , cc b phn hng hc ca h
thng da trn cc d liu quan st c.
(Khi h thng hot ng khng bnh thng)
4 - G ri (Debugging): M t cc phng php khc phc h thng khi gp
s c.
6

5 - Thit k : la chn cu hnh cc i tng nhm tho mn mt s rng
buc no :
x: CAD
Intelligent (x) : CAD
6 - Ging dy : Phn mm dy hc, c th chun on v sa li ca hc sinh
trong qu trnh hc tp.
- Multimedia
- Internet
Bi tp chng 1:
Cu 1: H chuyn gia l g? Cho v d?
Cu 2: Trnh by cu trc ca mt h chuyn gia trong thc t.
Cu 3: Lit k cc h chuyn gia c ng dng thc t (ti thiu 6 h).











7

Chng 2: Biu din tri thc
2.1. M u
chng trc chng ta c khi nim n gin nh th no l mt h
chuyn gia. Mt thnh phn v cng quan trng ca h chuyn gia l c s tri
thc. Thng qua cc phin thu np tri thc ( trc tip hay gin tip) chng ta xy
dng c mt c s tri thc cho h chuyn gia. Vy lm th no qun l v thao
tc x l h chuyn gia c th hot ng c. Trong chng ny chng ta s
cp n vn v gii quyt vn nh th no.

HCSTT/ HCGD = CSTT + MTSD + Giao Din + Gii thch + Thu np (KDD)/
Son tho (Tri thc chuyn gia)
KB Administrator - D tha
- ng n Chnh xc phi mu thun
Khng chnh xc
- T chc lu tr ..... suy din
hiu nng
- Phn tn
- Chuyn i biu din cc mc / user
2.2. D tha (Redundancy)
- CSTT = ( CS lut, CS s kin)
Rule Base, Fact base
Tri thc chuyn v l.vc Thng tin v mt bi ton (c th)
2.2.1. D tha lut
N: cho CSTT: B
1
= (R
1
, F
1
)
B
2
= (R
2
, F
2
)
Ta ni R
1
R
2
Sc mnh suy din ca R
1
bng sc mnh suy din ca R
2

Bao ng suy din cho R. Xt A_ F


Tin * **
8

A
+
R
= fe F/ A f

VD:
1) a .b c
2) b .c .d e
3) a .d f
4) c g
5)a h
6) d .c h
7) b u
{ } a
+
= { } h a,
{ } b a,
+
= { } h u g c b a , , , , ,
Nhn xt: Mt lut trong logic mnh PTH v bao ng = bao ng ca PTH
VD: Logic v t:
V
1
: td (U, XY) .t (V, XZ) SS (UV, YZ)
V
2
: SS (UV, XY) .SS (XY, ST) SS (UV, ST)
V
3
: SS (UV, XY) .SS (UT, XY) THAG (U,V,T)

t (U, XY) t (U, YX)
SS (UV, XY) SS (XY, UV)
SS (UV, XY) SS (VU, XY)






GT = t (P, AB), t (Q, AC), t (K,BQ), t (L,CP)

A
P
Q
B C
K L
GT
9

GT
+
R
= ?
VD: Quy np ton hc P
(x)

(1) P(1)
(2) P (i) P (i + 1)
{ }
+
R
P ) 1 ( = } { ),... 3 ( ), 2 ( ), 1 ( P P P
x P (x)
* Vic xc nh bao ng suy din da vo SD tin:

{ } d a, { } h d a , , suy din c tnh cht n iu (a,d,h,g)
VD: Y(x,y) C (x,y)
{ } ) , ( ), , ( c a Y b a Y Y(a,b), C(a,b)
Y(a,c), C(a,c)
VD: Xy dng tp lut cho Robot




Robot Tay (x)
Tay k
o
Trong (x)
Trn (x,y)
Tay k
o
.Trong (x) Tay (x) +
Tay (x) .Trong (y) Trn (x,y) +
Trong (y) -
Tay (x) San (x), Trong (x) +
Ta ni R
1
R
2
A_F A
+
1 R
= A
+
2 R

Gi s R = m:
R =
Max, min,quece, stack
(.vi logic m.) (3)
A

B

C
E A
C

E

B
10

r
i
: left
i
q
i


i
ft le s K
F s (1+K)m = (m)
F = 0 (m)
N:
Lut r e R tha trong R R\ { } r R
Tiu chun 1 (p dng cho logic mnh )
r: left q e R d tha qe left
+
r R /

gii thch:
left
{ } r R /
... q
Cu hi: Thut ton xc nh bao ng ca 1 tp
A
+
R
0 (m
2
) 0(m) (logic mnh )

VD:
1) a .m u
2) u c u c
3) a .b c a .b c
4) u b Q
3
: Th t c nh hng reR khng
5) b g
6) g c
- Khi xt cc biu din l logic v t vn d tha nh th no?
2.2.2. D tha s kin
Gi s c s lut khng cha lut d tha
N: Xt r : left q
f left
f c coi l d tha trong r thay r bi r

: left \ { } f q vn c tp lut tng

ng ( R { } r ) v { } r R
(SD tin)
11

TC 2: f d tha f e (left \ r
f
)
Gii thch: (m
2
)
r: (left\ { } f ) { } f q 0 (m)
CH :
- D tha khng c ngha l v ch
- Duy tr d tha ko theo nng cao cht lng suy din
KSTT q.nh d tha c v ch hay khng?
VD: GT = { } m a, KL = { } c
Vet
1
= r
1
, r
2
Vet
2
= { r
1
, r
4
, r
5
, r
6
}

Lut hp thnh (compositional rule):
T
vet1
: a . m c (tng suy din, gim b nh)
VD: H chuyn gia chng minh biu thc ho hc
Tri thc 7:
2.3. Mu thun (consistency - inconsistency)
2.3.1 Mu thun tng minh
- Khi duyt CSTT, ch qua ht bn ngoi ca cc lut pht hin ra ><
N:
Ta ni: r: left q >< r

: left

q

+ left _ left

hoc left

_ left
+ q >< q
Trong logic mnh : p ><
_
p
Trong logic v t: + p(a) ><
_
p (a)
+
_
p (a) >< x p(x)
+ p(a) >< x
_
p (a)
Trong lut s.xut: X = 3 >< X = 4
Xs 9 >< X > 10
R
+

12

Pht hin mu thun m(m - 1) cp (r, r

) 0(1)
ft le s k 0(m
2
)
0(k
2
) 0 (K log
2
K)
* X l mu thun
- X l cc b : r >< r

+ theo trng s
+ theo lnh vc chuyn mn
r thuc lnh vc chuyn mn A
r

thuc lnh vc chuyn mn B

+ theo x l ngoi l: r chung; r
-
ngoi l; left left

- X l tng th: th hin trong:
TH MU THUN : - nh l lut
- cnh l mu thun
(r, r

) eA r >< r


Nh vy:
r
10
r
9


r
1
r
5


r
8

r
100

Bin php: Vt b tp lut (tp con cc lut) R
0
_R sao cho R\ R
0
tr thnh phi ><
Theo nhng th: b lut cng cc cnh lin thuc c mt th con R\ R
0
ch
cn cc nh c lp (tc l (R, R
0
, ))
+ Tiu chun (R
0
) max / min
Tiu chun (R
0
) = R min

e
0
R r
w(r) min
2
A
13

2.3.2. Mu thun khng tng minh (KTM)
N: CSTT (R,F) cha >< KTM
F e F 1) F khng cha cp s kin ng

2) F
+
R
cha cp s kin ng F F
+
R

VD:
1) a b { } u a,
+
R
=
)
`

_
,... ,... , e e u a
2) b c
3) c d
4) d e
5) a .u v
6) v w
7) w.u
_
e
* Thut ton:
R={r
1
,r
2
,r
m
}
Xt a e F: R
1
={r
j
:left
j
q
j
/a eleft
j
}
R
2
={r
l
:left
l
q
l
/a eleft
l
}
R
3
=R\{R
1
,R
2
}
R
'
1
= R
1
R
3
; R
'
2
= R
2
R
3

Mu thun khng tng minh (R) Mu thun khng tng minh (R
'
1
) . mu
thun khng tng minh (R
'
2
)
Nu a R
1
= uhoc R
2
= u; R = LA

th mu thun khng tng minh (R)

left
+
R
cha cp s kin ng 0(m
2
)
2.4. Lu tr CSTT
A. Cu trc tnh: Vi bng lut lu tr bng mng ARRAY
VD: 1) a .b c
2) b .c .d e
SUY DIN *
R
a b c
b c d e
a d f
c g
a h
d c h
b u
V tri V phi
14

3) a .d f
4) c g
5) a h
6) d .c h
7) b u
Hai lu tr c s s kin v c s lut
Tn ngha C s lut
A
b
c
d
+ + + +

* * * *
- - - -
SK1
a
b
a
c
a
SK2
b
c
d
SK3

d
KL
c
e
f
g
f

B. Cu trc ng





. . . . . . .


a + +

b . . .
c * *


a
b
b e
c d e
15

C. Cu trc li
CS/ Bng s kin
Gi tr: lu thc trong my tnh (boolean)
Ng ngha: din gii ngha ca n
Cu hi: user a ra cc gi i vi s kin
Tr: ch ra v tr xut hn u tin trong bng lut
tr 1: ch s kin tip theo
tr 2: mc ni cc s kin cng tn
tr 3: np 1 danh sch mc ni gia cc lut
STT Tn Gi
tr
NN Ques VT VP Tro STT Tn
s.k
Tro1 Tro2 Tro3 Dng
1 a
+++
? 1 1 a 1
2 b
&&&
?? 1 2 b 1
3 c
***
??? 1 1 3 c 1


4 b 1
4 d
###
???? 1 5 c 1
5 e
$$$ ?????
1 6 d 1
7 c 1
8 a 1
9 d 1

Ch Cu trc d liu no th gn vi thao tc
+ Cp nht: thm, bt, sa: tt c thao tc ny l do ngi qun tr tri thc,
hay l k s tri thc m nhn
+ Suy din




16

2.5. Son tho tri thc:







Text Editor

Text Editor







2.6. Cp nht sa i
A. Hin th

CSTT Dng biu th ngoi text (linear)
ho (non-)
Linear a .b c a c
b .c .d e b d

e
Brower



K.E
BDTT
Text Editor Checker Mu thun Qun l d tha
CSTT
S chuyn i
Chuyn gia
(NN t nhin)
a b
C php
PT c php
Vn phm
text file
(NN lp trnh)
17

B. Cp nht
Thm c hi: mu thun
Bt D thng
Sa bt li: d tha
___________________________________________________________________
Bi tp chng 2:
Bi 1: Biu din mt c s tri thc trong thc t gm 6 lut.
Bi 2: Biu din mt c s tri thc gm 8 lut, xc nh v x l cc lut d tha.
Bi 3: Biu din mt c s tri thc gm 8 lut, xc nh v x l cc mu thun.
18

Chng 3: Cc k thut suy din v lp lun
3.1. Nhp mn




ng c, m t hay my suy din gm 2 b phn chnh:
- C ch suy din (Processor) gm:
+ Suy din tin Inference (CT, KL, set of facts) v KQ: boolean
+ Suy din li R: set of rule
- C ch c in (control unit):
+ chn hng suy din (MACRO)
+ chn lut
thng c MO (heuristc metaknowledge)
+ phn r CSTT SD phn tn
SD song song
+ Lc (tinh)
(nhn thy ci no khng cn thit th loi, xc nh ci no c chn trc)
3.2. Phn r CSTT
Fact Precedence Graph (FPG) = (F, A)
+ nh : tp cc s kin
+ Cung: (a,b)eA - r: left beR ; aeleft







USER
ng c

CSTT
Tnh hung
Kernel
19



D: 1) a b
2) b c
3) c e
4) c d
5) d .e f
6) b h
7) f .h g

Tp s kin:
F = { a, b, c, d, e, f, g, h} tch ra hai s kin:
F
1
= { a, b, c} R
1
= { a b, b c}
F
2
= { e, d, f, g, h} R
2
= { d.e f, f .h g}
R
0
= {c e, c d, b h}
F
0
= {b, c, d, b, h}

y l mt cch phn
r CSTT

eval({F
1
, F
2
}) min
- M hnh star







a b c
c
e d

f

h g


R
1

R
0
F
0
R
2
R
4
R
0
R
1
R
2
R
3
20








- Nu phn r da trn tp lut lm gc th dn n full condition
- Phn r theo tp s kin hnh sao.
3.3. M t suy din
A. Suy din tin, li (nhc li)
1. Suy din tin tm kim
VD: 1) a b
2) b c
3) c e
4)c d
GT = {a}
{a}
f
min {a,b} min {a,b,c} {a,b,c,d}

{a}

{a, b}

{a, b, c} {a, b, h}

{a, b, h, c}



A b
B c
C e
h e d
h b
d c
.

g h f .
r
1
2,6 r
2
3,4,6 r
3
r
1
r
2
r
6
(3,4,6)
(3,4)
.....
..... .....
5) d.e f
6) b h
7) f .h g
21


SUY DIN TIN TH SUY DIN TIN
1) GT
2) T.gian (SK chng minh)
3) THO
T.Gian T.Gian {q}
r: left q
r ethoa
4) Kt thc
T.Gian _KL
5) VT
1) nh gc
2) Nt
3) CUNG
T.Gian T.Gian
T.gian = Tgian {q}

4) L

5) ng i
Ch :
- Nu SDT theo vt cn phc tp tng ng vi qu trnh tm kim
trn th SD.
C
SD trn(vecan)
~C
tm kimVC
= 0(BH)
B: Branching ( phn nhnh) v H l chiu cao ca cy
2. Suy din li tm kim
{g} {f, h} {d, e, h}
TH SUY DIN LI ( And, or)
{g}

{f} {h}

{d} {e} {}

{c} {c} {a}

{b}

r
r
1
f
r
5



r
7
r
6
r
4
r
3

{a}
22


Suy din li tm kim theo chiu su
C
SDli
~ C
TKsu
= 0 (B
'
H
)
- Trong trng hp suy din li m c chu trnh :
* Prolog
r
1
A.B c
r
2
A.C B GT = {a, b, hc}
r
3
B.C A KL = {c}
r
4
a .hc A {c} {A, B} {B, C, B}
r
5
b.hc A
ch s max: {c} {AB} {B} u

B. Chn hng SD
- Tnh hung GT, KL NSD SD Tin, Li
- Tp lut R C
TIN
C
LI

0(B
T
H
T
) 0(B
L
H
L
)

- Cy SD tin G.thit Cy SD Li KL
K.lun GT
R R
B
T
(GT, KL, R) B
L
(GT, KL, R)
H
T
(GT, KL, R) H
L
(GT, KL, R)
B
T
= max B
T
(GT, KL, R)
G.thit: + H
T
H
L

+ c lng - B
T
- B
L

1. c lng B
T

VD:
r
1
A
r
3
A B
r
1

r
5
r
4


23

1) a .b .C c 9) a .b.c P
2) a .b .ma c 10) a .b.c P
3) a .b .mb c 11) a .b.c m
c

4) A.B C 12) a .ha S
5) a .hc B 13) a .b.C S
6) b .hc A 14) a .b.c .P S
7) a .R A 15) b.S hb
8) b .R B 16) S.p r
F
1
= {a, b, C} R
1
= {r
1
, r
2
}
F
2
= {a, b, m
a
} R
2
= {r
2
}
F
3
= {a, b, m
b
} R
3
= {r
3
}
F
4
= {A, B} R
4
= {r
4
}
F
5
= {a, h
c
} R
5
= {r
5
}
F
6
= {b, h
c
} R
6
= {r
6
}
F
7
= {a, R} R
7
= {r
7
}
F
8
= {b,R} R
8
= {r
8
}
F
9
= {a, b, c, p} R
9
= {r
9
, r
10
, r
11
, r
14
}
F
10
= {a, h
a
} R
10
= {r
12
}
F
11
= {b, S} R
11
= {r
15
}
F
12
= {S, p} R
12
= {r
16
}
c lng:
B
m
T
= max (2, 1, 4) = 4

_
T
B =
12
16
= 1,33

24

2.c lng B
L

c c 3 lut
C c 1
B c 2 B
L
max = 3
A c 2
_
L
B =
10
16
= 1,6
P c 1
p c 1
m
c
c 1
S c 3
h
b
c 1
r c 1
3. Lut (Meta Knowlegde)
1. If B
T
> B
L
Then chn Li
2. If B
T
> B
L
Then chn Tin
3. If B
T
= B
L
# GT > # KL Then chn Li
4. # GT < # KL Then chn Tin
0. If user thch Then chn
C. Chn lut trong qu trnh SD (Bi ton ng lut - Rule Conflict)
1. Suy din tin
Ti 1 thi im no trong qu trnh SD tin chng ta c th dng nhiu lut cng
mt lc:
TGian = {s kin f CM}; TG = {GT}
(M) THO = {r: left q/ left e TGian} tp lut c th p dng
(ng) VET = {r
1
r
k
} tp nhng lut dng
- Khi # THOA > 2 chn r e tho ?



25

2 c ch chn: + cng nhc (LIFO, FIFO) (su, rng)
(max, min)
+ mm do
u l qu trnh vt cn (ton b tp lut)
phc tp 0 (B
h
)
chn theo mm do hm
_
h (r) (heurestic)
Max/ min (extremum)
nh gi:
- # VET min (cng t cng tt)
- D min
VD: (*)
Gt = {a, b, R}, Kl = {p}
{a, b, R} {a, b, R, A} {a b R A B} {a bR AB} {a b RABCc}
VET = {r
7
, r
8
, r
4
, r
1
, r
9
, r
10
, r
11
}
A B C c P D = 2
Nn theo CS Min VET = {r
7
, r
8
, r
4
, r
1
, r
9
, r
10
, r
11
} (2)
CS Max VET = {r
8
, r
7
, r
4
, r
13
, r
11
} (1)
FIFO VET = {r
7
r
8
r
4
r
11
r
13
r
9
r
10
r
11
} (3)
LIFO VET = {r
8
r
7
r
4
r
13
r
15
r
1
r
9
r
10
r
11
} (4)
Vy c cch no D = 0 ?
{a, b, R} {a, b, R, A} {a, b, R, A, B} {a, b, R, A, B, C}...





7,8
CS min r
4
r
min



r
7 8
r
8

1,13
r
1 13,9,10,11
7,8
r
7
r
8

4
r
4

1,13

26

th FPG (Fact Precedence Graph)
S dng miu t mi tng quan gia iu ny vi iu khc
Vd (*)












h

1
(r) = h

1
(r: left q)
= UL (a, K, L) = kc
FPG
(a, KL)
Chn r: h

1
(r) min
NXt: 1) f g FPG th f c dng trc tip suy ra G (r: left g, f left)
2) C ng i P: f g th c dng gin tip suy ra g.
{a,b,r}
7,8
{a b R A}
8
{a b R A B}
4
{a b R A B C}
1,13
..
h

1
(r
7
)=kc(A,p)=3
h

1
(r
8
)=kc(B,p)=3
h

1
(r
1
)=kc(c,p)=1
h

1
(r
13
)=kc(s,p)=
h

1
(r
9
)=kc(P,p)=
h

1
(r
10
)=kc(m
c
,p)=
h

1
(r
11
)=kc(p,p)=0
Chn r
1
Chn r
11
h
c
R

A B
C
a b
m
a
c m
b
m
c
P p


h
a
S
h
b

r
27

Nhn xt:
#VET +Complexity h

x m
ii) th RPG(Rule Precedence Graph)
RPG=(R,A)
Trong R: Tp cc nh
A: l tp cc cnh sao cho:
r r, r:left q qeleft
r:left q
VD:Xy dng th RPG cho v d trn ta c:









*Xy dng hm h

2
(r)?
h

2
(r)=?
R
KL
={r:left q/q e KL}eR
h

2
(r)=kc
RPG
(r,R
KL
)
Chn r sao cho h

2
(r) min
Xt v d sau:
GT={a b R}, KL={r}
{a,b,r}
7,8
{a b R A}
8
{a b R A B}
4
{a b R A B C}
1,13
{a b R A B C
c}
9,10,11
..KL
h

2
(r
7
)=kc
RPG
(r
7
, r
16
)=3

r
5
r
13

r
6
r
4
r
1 r+9

r
7
r
2
r
10

r
8
r
3
r
11
r
16


r
14

r
12
r
15

28

h

2
(r
8
)=kc
RPG
(r
8
, r
16
)=3

h

2
(r
1
)=kc
RPG
(r
1
, r
16
)=2
h

2
(r
13
)=kc
RPG
(r
13
, r
16
)=1
h

2
(r
15
)=kc
RPG
(r
15
, r
16
)=
h

2
(r
10
)=kc
RPG
(r
10
, r
10
)=1
h

2
(r
11
)=kc
RPG
(r
11
, r
16
)=1
h

2
(r
14
)=kc
RPG
(r
14
, r
16
)=1
h

2
(r
16
)=kc
RPG
(r
16
, r
16
)=0
2. Suy din li
th FPG
Tnh hung ng khi suy din li:
Goal= Tp nhng s kin cn chng minh; ban u Goal=KL
Xt f Goal. C nhiu lut suy ra f. Ta chn lut bng cc th sai v quay lui.
trnh phi quay lui ta cn chn lut nh th no.
Nhc li cc cch chn c quay lui:
+ cng nhc: - Ch s max: chn lut c ch s ln nht trong tp lut tho
- Ch s min: chn lut c ch s nh nht trong tp lut tho
+ mm do : h

(r) max/min: nh gi tt hay khng da vo quay lui, cng

nhiu cng km
VD:
GT={a b R}
{S}
12,13,14
{a b c p}{a b m
b
p} .
* Cch tnh h

3
(r)
h

3
(r)=h

3
(left f)=kc(GT,left)
Chn r: h

3
(r) min
Kc(GT, left)=max(GT,a)
ae left
Chn r
13
29

Kc(GT, left)=max(b,a)
be GT
VD: GT={a b R}, KL={S}
{S}
12,13,14
{a b c p}{a b m
b
p} .
h

3
(r
12
)=kc(a b R,a h
a
)=
h

3
(r
13
)=kc(a b R,a a b C)= 2
h

3
(r
14
)=kc(a b R,a b c p)= 4
h

3
(r
6
)=kc(a b R,b h
c
)=
h

3
(r
17
)=kc(a b R,a R)= 0
h

3
(r
5
)=kc(a b R,a h
c
)=
h

3
(r
8
)=kc(a b R,b R)= 0
ii) th RPG.
* Cch tnh h

4
(r)?
h

4
(r)=kc
RPG
(R
GT
, r)
Chn r: h

4
(r) min
R
GT
={r: left q/left eGT}
VD: GT={a b R} KL={S}
{S}
12,13,14
{a b c p}{a b m
b
p} .
Tnh h

4
(r) ta c:
.
D. Hn ch cc ng vin trong qu trnh suy din
1. Suy din tin
Gi s xt ti mt thi im trong qu trnh suy din :
+ Thi gian
+ THO= LC(R, TGian)={r: left q/ left e TGian}

THO THO . Khi la chn trong THO bng phng php vt cn hay
heuristic.
Chn r
13
Chn r
7
Chn r
8
(Hn ch cc ng vin)
30

1. Suy din li
Xt 1 s kin thuc Goal.
h

() = /min XACDINH (f) = {r; left f}

= 0/max K s tri thc
XACDINH(f) e XACDINH (f)
Kt lun: Nng cao hiu qu qu trnh suy din
- Chn hng suy din
- Chn lut
- Phn tch c s tri thc (CSTT)
- Hn ch ng vin
3.4. Biu din TRI THC bng LOGIC v t v SUY DIN
Lut r
i
P
1
() . P
2
() . .P
n
() q ()
P
i
() l v t / predicate: l nhng pht biu c ph thuc vo cc bin
q () hay tham s
VD: Cc nh l hnh hc
1.t(U,XY) . t(V,XZ) SS(UV,XZ)
2.SS(UV,XY) . SS(UV,ST) SS(ST,XY)
3.SS(XY,UV) . SS(XZ,UV) Thang(X,Y,Z)
4.SS(XY,UV) . Thang(X,Y,Z) SS(UV,XZ)

t(U,XY) t(U,YX)
SS(XY,UV) SS(UV,XY)
SS(XY,UV) SS(VU,YX)
A. Suy din tin
GT: t (P, AB); t (Q, AC)
t (I, BQ); t (J, CP)
t (E, CQ)
KL { SS (PS, BC)


Control
mechanisms
Explicit
Implici t
A
P
Q
B C
I J
31


B
'
1
: TG
0
= GT
THOA = {(r
1
, u
1
), (r
1
, u
2
), (r
1
, u
3
), (r
1
, u
4
)}
u
1
= {A/X; B/Y; C/Z; P/U; Q/V}
u
2
= {C/X; Q/Y; P/Z; E/U; J/V}
u
3
= ...
u
4
= ....
Chn (r
1
, u
1
)
TG
1
= TG
0
{SS (UV, YZ), u
1
} = TG
0
{SS (PQ, BC)}
B
'
2
: TG
1
=
THOA = {(r
1
, u
2
), (r
1
, u
3
), (r
1
, u
4
)
.
V: Lm nh th no xc nh (r
i
, u
i
)
B. Suy din li.
Ni chung suy din tin v suy din li u ging nh nhau trong logic mnh v
u l qu trnh hp nht (Unification)
r hn ta hy xt v d sau:
GT t(P,AB), t(Q,AC), t(I,PQ), t(J,CP), t(E,QC)
KL SS(IJ, BC)

Ta p dng th tc suy din li, nhng co kh khn l khi khng tip tc c ta li
phi quay lui.T y ta c th a ra nhn xt sau:
S ging v khc nhau gia suy din li ca logic v t v suy din Prolog
- Ging nhau: c trong prolog cv logic v t u c php hp nht v qu trnh
th sai
- Khc nhau: Tnh cht trong prolog l chng minh suy ra iu v l, cn suy
din li l suy ra goal=0. C ch ca prolog l theo ch s min v i t tri
sang phi. Cn trong logic v t th c th p dng ht mi cacchs i thng
thng: Trai, phi v ngc li hay l trn dui v ngc li.
32

3.5. ng dng cc k thut suy din vo xy dng h chuyn gia
3.5.1. Giao din
3.5.1.1. M u
u tin chng ta xt n cc loi ngi s dng h chuyn gia. Bao gm 4 loi sau:
- Ngi s dng khng chuyn, u cui.
- Ngi s dng chuyn , thng s dng h thng trnh khng cao.
- Ngi s dng l k s tri thc
- Ngi s dng la chuyn gia
gc t vn cn gii quyt cc vn sau:

T vn + Tnh hung: + bit
+ iu cn bit
+ Thu thp gi thit
+ Cht vn v gii thch
Nh vy chng ta c th cng i n mt nh ngha v giao din: Ngi s dng
nhm mc ch thu thp thong tin ban u v tnh hung cn t vn.
Cc vn cn phi gii quyt:
- Xc nh tp HI: nhng iu cn hi
- Phng thc hi: Thn thin vi ngi s dng( ta c th a v gn ngn ng t
nhin bao nhiu cng tt by nhiu) hay Trnh hi tha.
3.5.1.2 Xc nh tp nhng s kin cn hi.
A. Khi bit kt lun.
Khi tp cc s kin cn hi l:
HI = Tp cc s kin lin quan n kt lun (xt trong lin quan n tp lut)
i) Phng thc hi gn
Ta xt v d sau:
1. a . b c
2. d . e f
3. c . e g
Thng
l t vn
Lm vic ch yu vi
phn son tho tri thc
33

4. d . b h
5. m g
6. m.a h
7. f . h k
8. g . c k
KL={k} Khi ta c:
HI
gn
= U{left
i
/ r:left q
i
, q
i
eKL}
= {f c g h}
Nhn xt:
HI
gn
={f/ -(f,g)e FPG, g eKL}
ii) Hi xa
HI
xa
= {f/ - ng i p FPG, p= f g, ge KL}
TRI=

m
i i =
left
i
PHI={q
1
q
n
}
R={r
1
..r
m
}
r
i
: left
i
q
i
HI
xa
={f eTRAI\ PHI/ - ng i p:f .. g, g eKL}
B. Khng bit kt lun
HI= TRI \ PHI
Xt vid d trn:
TRI={ a b c m n f g h}
PHI={c f g h k}
HI=TRI \ PHI={a b d e m n}
3.5.1.3. Phng thc hi gn
A. Hi thn thin
HI={au,..}
fe HI Cu hi (f) l mt vn bn hin ln mn hnh nhm gi ngi
dng a thng tin v s kin f
34


B. Trnh cu hi tha
Hi c tnh n kt qu tr li ca cc cu hi trc KCH BN HI/ CY HI
1. Hi xa.
2. Hi gn
3.5.1.4 Giao din ngi s dng
Giao din l hin th c s tri thc bng ho
Cc loi hin th:
+ Tuyn tnh: r
i
: left
i
q
1

..
r
m
: left
m
q
m

feF Din gii (f)
r
1
: p
1
.. .p
n
q
Nu nh din gii p
1
v .. din gii p
n
th din gii q
+ Phi tuyn:
. th FPG
. th RPG
. Cy lng nhau











35

3.5.2. Modul gii thch
3.5.2.1. M u







Tr gip o to: Cho NSD thng tin v vn no :
+CSTT: Why
+ Suy din : How
Yu t tm l vi ngi dng: Tng sc thuyt phc .
Phn loi cu hi hi ngi s dng.
Why f? Ti sao li cn c thng tin c thng tin v s kin f.
Why r? Ti sao li c lut r trong CSTT
How f? Lm th no a ra Kt Lun, nhn nh f
How not f Ti sao li khng c kt lun, s kin f.
Cu hi gi nh: What If1) what if thm f
2) what if thm r
3.5.2.2 Cu hi why f.
Phin lm vic user gm 2 phn Phin HI
Phin s dng( hnh v)






User
G
D
MTSD
CSTT
36








Muc ch ca cu hi why
- Ngi sr dng mun bit tm quan trng/ s lin quan ca f vi qu trnh s dng
H thng ch ra mi lin h ca f vi mc ch s dng
V mt k thut : xc nh xem fKL c mi quan h no khng
Phng thc tr li: C hai phng thc l:
- Phng thc 1:Da trn th FPG( Khi ta tm xem c ng i t f n KL ?)
Ma trn lin thuc
G=(N,A) Biu din ma trn M
nxm
Trong :
.
- Phng thc 2:Da vo phng php xc nh hi( xa, gn) . Phng php ny
cn phi bit kt lun trc
3.5.2.3. Why?
Mc ch: Ti sao li c lut/ tri thc R trong c s tri thc. Xut s, ngun thu
thph tri thc r.
H thng: Ch r c phng thc c c tri thc r
K thut: e R r km theo xut s:
- Ngun ti liu+ K s tri thc/ chuyn gia
- kin chuyn gia
S dng phng php no KDD v trn ngun thng tin no Thu np mt cch
t ng.
Tm li h thng cn m bo cho ngi s dng c cung cp thng tin mt cch
c xut s.
TR LI
User
G
D
MTSD f ?
f !

WHY f?
CSTT
37

3.5.2.4. Cu hi How f
Ngi s dng ang c cung cp s b v mt lnh vc no y . Much ch
ngi s dng mun bit qu trnh suuy din suy ra f.
H thng:
- GI THIT: Tp tin ngi s dng cung cp trc tip hoc gin tip.
K thut: Xc ng c cch suy din. T c c vt suy din.
Vt ={r
i1
, r
i2
..r
ik
}
GT TG
1
.TG
k
f
Phng thc tr li.
-Mt lo: a ra ton b s kin
-Nht gng: Ch a ra mt bc ca ngi s dng( thng l bc cui)
Ch : Vic la chn phng thc ph thuc vo ng cnh ca ngi s dng.
3.5.2.5.Cu hi How not f
Ngi s dng mun bit l do khng c kt lun f
H thng: GT KL
Phng thc:
- Trn thut: Da tn suy din li
- Trc tip: Da trn suy din tin
Khc phc nhng d thng: Bng cch xy dng tp hp hi, thm tri thc vo h
thng.
Bi tp chng 3:
Bi 1: Biu din mt c s tri thc bng logic mnh trong thc t gm 6 lut.
Bi 2: Biu din mt c s tri thc trong thc t, p dng th tc suy din tin vo
c s tri thc.
Bi 3: Biu din mt c s tri thc trong thc t, p dng th tc suy din li vo c
s tri thc.


38

Chng 4: H h tr ra quyt nh
4.1. Khi nim v h h tr ra quyt nh
- Cc khi nim cn bn v quyt nh
Th d v h h tr quyt nh (HHTQ)
Nghin cu v hoch nh tip th: chnh sch gi cho khch hng, d bo sn
phm tiu th ..
Hoch nh chin lc v vn hnh: theo di, phn tch v bo co v xu hng
th trng ..
H tr bn hng: chi tit v tng hp tnh hnh bn hng, so snh v phn tch xu
hng bn hng ..
- Quyt nh l g ?
l mt la chn v ng li hnh ng (Simon 1960; Costello & Zalkind
1963; Churchman 1968), hay chin lc hnh ng (Fishburn 1964) dn n mt
mc tiu mong mun (Churchman 1968)
- Ra quyt nh l g ?
Mt qu trnh la chn c thc gia hai hay nhiu phng n chn ra mt
phng n to ra c mt kt qu mong mun trong cc iu kin rng buc
bit. Quyt nh c th l nhn thc dng s kin, Chi $10,000 cho qung co
vo qu 3 . Quyt nh c th l nhn thc dng qu trnh, Trc tin thc hin
A, sau B hai ln v nu c p ng tt hy thc thi C. Quyt nh c th l mt
hot ng giu kin thc, Quyt nh c kt lun no th hp l/hp l trong hon
cnh no ? Quyt nh c th l nhng thay i trng thi kin thc. Quyt nh c
chp nhn mt kin thc mi khng ?
Ti sao phi h tr ra quyt nh ?
Nhu cu h tr ra quyt nh
+ Ra quyt nh lun cn x l kin thc
+ Kin thc l nguyn liu v thnh phm ca ra quyt nh, cn c s hu hoc
tch ly bi ngi ra quyt nh
39

Gii hn v nhn thc (tr nh c hn ..)
Gii hn v kinh t (chi ph nhn lc ..)
Gii hn v thi gian
p lc cnh tranh
Bn cht ca h tr ra quyt nh
cung cp thng tin, tri thc
c th th hin qua tng tc ngi - my, qua m phng
Cc yu t nh hng n ra quyt nh
Cng ngh - thng tin - my tnh
Tnh cnh tranh - s phc tp v cu trc
Th trng quc t - n nh chnh tr - ch ngha tiu th
Cc thay i bin ng
4.2. Cu trc ca mt h h tr ra quyt nh
Cc nh ngha trc y ca HHTQ nhn mnh vo kh nng h tr cc nh ra
quyt nh qun l trong cc tnh hung na cu trc. Nh vy, HHTQ c ngha
l mt b tr cho cc nh qun l nhm m rng nng lc nhng khng thay th kh
nng phn x ca h. Tnh hung y l cn n cc phn x ca cc nh qun l
hay cc quyt nh khng hon ton c gii quyt thng qua cc gii thut cht
ch.
Thng thng cc HHTQ s l cc h thng tin my tnh ha, c giao tip ha
v lm vic ch tng tc trn cc mng my tnh.
C s ca cc nh ngha v HHTQ thay i t nhn thc HHTQ lm g (th d,
h tr ra quyt nh trong cc bi ton phi cu trc) cho n cch thc t c cc
mc tiu ca HHTQ (cc thnh phn yu cu, khun mu s dng, qu trnh pht
trin ..)
40

Cu trc c bn ca mt h h tr ra quyt nh:

Phn h qun l d liu gm mt c s d liu (database) cha cc d liu cn
thit ca tnh hung v c qun l bi mt h qun tr c s d liu (DBMS - data
base management system). Phn h ny c th c kt ni vi nh kho d liu ca
t chc (data warehouse) - l kho cha d liu ca t chc c lin i n vn ra
quyt nh.
Phn h qun l m hnh cn c gi l h qun tr c s m hnh (MBMS -
model base management system) l gi phn mm gm cc thnh phn v thng k,
ti chnh, khoa hc qun l hay cc phng php nh lng nhm trang b cho h
thng nng lc phn tch; cng c th c cc ngn ng m hnh ha y. Thnh
phn ny c th kt ni vi cc kho cha m hnh ca t chc hay bn ngoi no
khc.
Phn h qun l da vo kin thc c th h tr cc phn h khc hay hot ng
c lp nhm a ra tnh thng minh ca quyt nh a ra. N cng c th c
kt ni vi cc kho kin thc khc ca t chc.
41

Phn h giao din ngi dng gip ngi s dng giao tip vi v ra lnh cho h
thng. Cc thnh phn va k trn to nn HHTQ, c th kt ni vi
intranet/extranet ca t chc hay kt ni trc tip vi Internet.
Bi tp chng 4:
Cu 1: Nu ra 5 h h tr ra quyt nh c ng dng trong thc t.
Cu 2: Trnh by chi tit cu trc ca mt h h tr ra quyt nh c ng dng.
Cu 3: Thit k mt h h tr ra quyt nh da trn l thuyt c hc.
42

Chng 5: My hc
5.1. Th no l my hc?
Thut ng "hc" theo ngha thng thng l tip thu tri thc bit cch vn dng.
ngoi i, qu tr hc din ra di nhiu hnh thc khc nhau nh hc thuc lng
(hc vt), hc theo kinh nghim (hc da theo trng hp), hc theo kiu nghe
nhn,... Trn my tnh cng c nhiu thut ton hc khc nhau. Tuy nhin, trong
phm vi ca gio trnh ny, chng ta ch kho st phng php hc da theo trng
hp. Theo phng php ny, h thng s c cung cp mt s cc trng hp
"mu", da trn tp mu ny, h thng s tin hnh phn tch v rt ra cc quy lut
(biu din bng lut sinh). Sau , h thng s da trn cc lut ny "nh gi"
cc trng hp khc (thng khng ging nh cc trng hp "mu"). Ngay c ch
vi kiu hc ny, chng ta cng c nhiu thut ton hc khc nhau. Mt ln na,
vi mc ch gii thiu, chng ta ch kho st mt trng hp n gin.
C th khi qut qu trnh hc theo trng hp di dng hnh thc nh sau :
D liu cung cp cho h thng l mt nh x f trong ng mt trng hp p trong
tp hp P vi mt "lp" r trong tp R.
f : P | R
p r
Tuy nhin, tp P thng nh (v hu hn) so vi tp tt c cc trng hp cn quan
tm P (P P). Mc tiu ca chng ta l xy dng nh x f sao cho c th ng mi
trng hp p trong tp P vi mt "lp" r trong tp R. Hn na, f phi bo ton f,
ngha l :
Vi mi p P th f(p) f (p)
Phng php hc theo trng hp l mt phng php ph bin trong c nghin cu
khoa hc v m tn d oan. C hai u da trn cc d liu quan st, thng k t
rt ra cc quy lut. Tuy nhin, khc vi khoa hc, m tn d oan thng da trn
tp mu khng c trng, cc b, thiu c s khoa hc.
43

5.2. Hc bng cch xy dng cy nh danh
Pht biu hnh thc c th kh hnh dung. c th hn, ta hy cng nhau quan st
mt v d c. Nhim v ca chng ta trong v d ny l xy dng cc quy lut c
th kt lun mt ngi nh th no khi i tm bin th b chy nng. Ta gi tnh cht
chy nng hay khng chy nng l thuc tnh quan tm (thuc tnh mc tiu). Nh
vy, trong trng hp ny, tp R ca chng ta ch gm c hai phn t {"chy nng",
"bnh thng"}. Cn tp P l tt c nhng ngi c lit k trong bng di (8
ngi) Chng ta quan st hin tng chy nng da trn 4 thuc tnh sau : chiu cao
(cao, trung bnh, thp), mu tc (vng, nu, ) cn nng (nh, TB, nng), dng kem
(c, khng),. Ta gi cc thuc tnh ny gi l thuc tnh dn xut.
D nhin l trong thc t c th a ra c mt kt lun nh vy, chng ta cn
nhiu d liu hn v ng thi cng cn nhiu thuc tnh dn xut trn. V d n
gin ny ch nhm minh ha tng ca thut ton my hc m chng ta sp
trnh by.
Tn Tc Ch.Cao Cn
Nng
Dng
kem?
Kt qu
Sarah Vng T.Bnh Nh Khng Chy
Dana Vng Cao T.Bnh C Khng
Alex Nu Thp T.Bnh C Khng
Annie Vng Thp T.Bnh Khng Chy
Emilie T.Bnh Nng Khng Chy
Peter Nu Cao Nng Khng Khng
John Nu T.Bnh Nng Khng Khng
Kartie Vng Thp Nh C Khng
44

tng u tin ca phng php ny l tm cch phn hoch tp P ban u thnh
cc tp Pi sao cho tt c cc phn t trong tt c cc tp Pi u c chung thuc tnh
mc tiu.
P = P1 P2 ... Pn v " (i,j) i j : th (Pi Pj = ) v
" i, " k,l : pk Pi v pl Pj th f(pk) = f(pl)
Sau khi phn hoch xong tp P thnh tp cc phn hoch Pi c c trng bi
thuc tnh ch ri (ri R), bc tip theo l ng vi mi phn hoch Pi ta xy dng
lut Li : GTi ri trong cc GTi l mnh c hnh thnh bng cch kt hp
cc thuc tnh dn xut.
Mt ln na, vn hnh thc c th lm bn cm thy kh khn. Chng ta hy th
tng trn vi bng s liu m ta c.

C hai cch phn hoch hin nhin nht m ai cng c th ngh ra. Cch u tin l
cho mi ngi vo mt phn hoch ring (P1 = {Sarah}, P2 = {Dana}, tng cng
s c 8 phn hoch cho 8 ngi). Cch th hai l phn hoch thnh hai tp, mt tp
gm tt c nhng ngi chy nng v tp cn li bao gm tt c nhng ngi khng
chy nng. Tuy n gin nhng phn hoch theo kiu ny th chng ta chng gii
quyt c g !!
5.2.1. m chi
Chng ta hy th mt phng php khc. By gi bn hy quan st thuc tnh u
tin mu tc. Nu da theo mu tc phn chia ta s c c 3 phn hoch khc
nhau ng vi mi gi tr ca thuc tnh mu tc. C th l :
Pvng = { Sarah, Dana, Annie, Kartie }
Pnu = { Alex, Peter, John }
P = { Emmile }
Ta thy rng phn hoch Pnu v P tha mn c iu kin "c chung thuc tnh
mc tiu" (Pnu cha ton ngi khng chy nng, P cha ton ngi chy
nng).
45

Cn li tp Pvng l cn ln ln ngi chy nng v khng chy nng. Ta s tip tc
phn hoch tp ny thnh cc tp con. By gi ta hy quan st thuc tnh chiu cao.
Thuc tnh ny gip phn hoch tp Pvng thnh 3 tp con : PVng, Thp = {Annie,
Kartie}, PVng, T.Bnh= {Sarah} v PVng,Cao= { Dana }
Nu ni tip vo cy hnh trc ta s c hnh nh cy phn hoch nh sau :
Qu trnh ny c th tip tc cho n khi tt c cc nt l ca cy khng cn ln ln
gia chy nng v khng chy nng na. Bn cng thy rng, qua mi bc phn
hoch cy phn hoch ngy cng "phnh" ra. Chnh v vy m qu trnh ny c
gi l qu trnh "m chi". Cy m chng ta ang xy dng c gi l cy nh
danh.
n y, chng ta li gp mt vn mi. Nu nh ban u ta khng chn thuc
tnh mu tc phn hoch m chn thuc tnh khc nh chiu cao chng hn
phn hoch th sao? Cui cng th cch phn hoch no s tt hn?
5.2.2. Phng n chn thuc tnh phn hoch
Vn m chng ta gp phi cng tng t nh bi ton tm kim : "ng trc
mt ng r, ta cn phi i vo hng no?". Hai phng php nh gi di y s
gip ta chn c thuc tnh phn hoch ti mi bc xy dng cy nh danh.
5.2.2.1. Quinlan
Quinlan quyt nh thuc tnh phn hoch bng cch xy dng cc vector c trng
cho mi gi tr ca tng thuc tnh dn xut v thuc tnh mc tiu. Cch tnh c th
nh sau :
Vi mi thuc tnh dn xut A cn c th s dng phn hoch, tnh :
VA(j) = ( T(j , r1), T(j , r2) , , T(j , rn) )
T(j, ri) = (tng s phn t trong phn hoch c gi tr thuc tnh dn xut A l j v
c gi tr thuc tnh mc tiu l ri ) / ( tng s phn t trong phn hoch c gi tr
thuc tnh dn xut A l j )
* trong r1, r2, , rn l cc gi tr ca thuc tnh mc tiu
*
46

Nh vy nu mt thuc tnh A c th nhn mt trong 5 gi tr khc nhau th n s c
5 vector c trng.
Mt vector V(Aj ) c gi l vector n v nu n ch c duy nht mt thnh phn
c gi tr 1 v nhng thnh phn khc c gi tr 0.
Thuc tnh c chn phn hoch l thuc tnh c nhiu vector n v nht.
Tr li v d ca chng ta, trng thi ban u (cha phn hoch) chng ta s tnh
vector c trng cho tng thuc tnh dn xut tm ra thuc tnh dng phn
hoch. u tin l thuc tnh mu tc. Thuc tnh mu tc c 3 gi tr khc nhau
(vng, , nu) nn s c 3 vector c trng tng ng l :
VTc (vng) = ( T(vng, chy nng), T(vng, khng chy nng) )
S ngi tc vng l : 4
S ngi tc vng v chy nng l : 2
S ngi tc vng v khng chy nng l : 2
Do
VTc(vng) = (2/4 , 2/4) = (0.5, 0.5)
Tng t
VTc(nu) = (0/3, 3/3) = (0,1) (vector n v)
S ngi tc nu l : 3
S ngi tc nu v chy nng l : 0
S ngi tc nu v khng chy nng l : 3
VTc() = (1/1, 0/1) = (1,0) (vector n v)
Tng s vector n v ca thuc tnh tc vng l 2
Cc thuc tnh khc c tnh tng t, kt qu nh sau :
VC.Cao(Cao) = (0/2,2/2) = (0,1)
VC.Cao(T.B) = (2/3,1/3)
VC.Cao(Thp) = (1/3,2/3)
VC.Nng (Nh) = (1/2,1/2)
VC.Nng (T.B) = (1/3,2/3)
VC.Nng (Nng) = (1/3,2/3)
47


VKem (C) = (3/3,0/3) = (1,0)
VKem (Khng) = (3/5,2/5)
Nh vy thuc tnh mu tc c s vector n v nhiu nht nn s c chn
phn hoch.
Sau khi phn hoch theo mu tc xong, ch c phn hoch theo tc vng (Pvng) l
cn cha nhng ngi chy nng v khng chy nng nn ta s tip tc phn hoch
tp ny. Ta s thc hin thao tc tnh vector c trng tng t i vi cc thuc
tnh cn li (chiu cao, cn nng, dng kem). Trong phn hoch Pvng, tp d liu
ca chng ta cn li l :
Tn Ch.Cao Cn
Nng
Dng
kem?
Kt qu
Sarah T.Bnh Nh Khng Chy
Dana Cao T.Bnh C Khng
Annie Thp T.Bnh Khng Chy
Kartie Thp Nh C Khng

VC.Cao(Cao) = (0/1,1/1) = (0,1)
VC.Cao(T.B) = (1/1,0/1) = (1,0)
VC.Cao(Thp) = (1/2,1/2)

VC.Nng (Nh) = (1/2,1/2)
VC.Nng (T.B) = (1/2,1/2)
VC.Nng (Nng) = (0,0)

VKem (C) = (0/2,2/2) = (0,1)
48

VKem (Khng) = (2/2,0/2) = (1,0)
2 thuc tnh dmg kem v chiu cao u c 2 vector n v. Tuy nhin, s phn
hoch ca thuc tnh dng kem l t hn nn ta chn phn hoch theo thuc tnh
dng kem.
Bi tp chng 5:
Bi 1: Nu ra cc 5 v d ng dng my hc trong thc t.
Bi 2: Thu thp d liu cho mt h d bo tng gim mt ch s chng khon. Xy
dng cy nh danh v a ra tp lut cho h trn.
Bi 3: Thu thp d liu cho mt h d bo i vi sinh vin d thi tuyn sinh i
hc. Xy dng cy nh danh v a ra tp lut cho h trn.

49

Chng 6: Logic m v lp lun xp x
6.1. Biu din tri thc bng LOGIC V T.
CSTT(knowlegde) = C s s kin, C s lut






Cc s kin(Fact) c m t bi V t(Predicate). Mi v t l mt pht biu, quan
st v i tng m ta ang xt.
F={p(t
1
,t
2
.t
n
)/p v t}
p: Tn v t
t
i
: hng thc( tm) c th l mt bin, mthng, hoc l mt hm(rt quan trng)
VD: Ai cng c ke yu ngi ght.
..
Lut( Rule)
Mi tri thc chuyn mn u c biu din bng mnh .: Nu..th.
p
1
(t
1
.t
k
)..p
n
(u
1
..u
n
) suy ra q(v
1
.v
m
)
trong : p
i
, q: Tn v t
t
i
, u, v: cc hng thc
Cu(clause)
l mt cu v tng ng vi mt lut c dng nh trn
6.2. Mt s v d
Bi ton ch vt qua sng.
Coa mt con si, mt con d v mt chic bp ci mun qua sng. Nhng ch s mt
bc li . Lm th no d bc li c th ch c cc vt trn qua sng an ton.
Thng tin v tnh
hung
(Do ngi s dng)
Tri thc v lnh
vc chuyn mn
(Do chuyn gia)
Cung cp qua
phin hi
C qua phin
thu np tri thc
50

Bit rng Si n tht d nu ch c hai con mt mnh, d n bp ci nu nh khng
c si .






Biu din:
-V tr :vt(L,S,D,B)
-An ton: at(L,S,D,B)
-V tr xut pht, n : ql(1, 2)
Ta c m t nh sau:
1. vt(b,b,b,b)
2. dd(b,n)
3. dd(n,b)
4. vt(LD,S,D,B) .dd at(LD,LD) .at(LD,S,D,B) vt(LD,S,D,B)
5. vt(X,X,D,B) . dd(X,X) .at(X,X,D,B) vt(X,X,D,B)
6. vt(X,S,X,B) . dd(X,X) .at(X,X,B,S) vt(X,X,B,S)
7. vt(X,S,X,D) . dd(X,X) .at(X,X,D,S) vt(X,X,D,S)
8. at(X S X B)
9. dd(X X) at(X X X X)
Tm li ta thy y ch l lut v s kin ch khng phi tri thc chuyn gia
6.3. C ch suy din
SUY DIN: +Suy din tin( Modus Ponens, Modus Tollens)
+Suy din li( Modus Ponens, Modus Tollens)



Si D Bp ci B bc

Li




B nam
51









V d:
1. membership( x
1
, [x
1
:-] )
l danh sch c hai phn t vi: +) x l phn t u
+)- l m t cc phn cn li
2. membership( x
2
, [-:y] )
:- membership (x
2
, y)
Goal: membership(1, [ 1,2,3]): :- membership (1, [1,2,3])
Ch : Trong Prolog p dng suy din li vi: lut theo ch s min v s kin t tri
qua phi
T gi thit v p dng phng php suy din li ta c qu trnh suy din nh sau:
3. :-mb(x, [1,2,3])
4. :- {x/x
1
, 1/x
1
} (3,1) nn x=1
5. :-mb(x,[2,3] {x/x
2
; 2,3/x
1
} (3,2)
6. :- {x/x
3
; 2/x} (5,1)nn x=2
7. :-mb(x,[3]) {x/x
4
; 3/x
4
} (5,2)
8. :- {3/x} (7,1) nn x=3
9. :--mb(x,[]) (7,2)
10. fail (9,1)
11. fail (9,2)




p
q p

p
q p v

: p
p : q



q q q:-


Rule Clause Prolog rule
52

6.4. Biu din tri thc bng logic m v suy din
6.4.1. Tp m( Fuzzy set)
Tr li vi cc kiu nh ngha v tp hp (set) . Chng ta bit l c hai kiu nh
ngha tp hp:
1- Phng php lt k tt c cc phn t thuc tp hp . V d tp s nguyn
nh hn 10 l tp: N=1,2,3,4,5,6,7,8,9
2- Phng php m t thng qua v t c trng( characteurstic predicate)
P
A
(x) = 1 nu x eA
0 nu xe A
P
A
: U {0,1}
X eU P
A
(x)
Trc quan Tru tng
A B P
A.
P
B

A B P
Av
P
B

A \B P
A .
P
B

A =B P
A
P
B

M rng: | | 1 , 0 ~
A

:x 1 ) ( 0 ~ s s x
A

Vy khi c tp m A
~
: th ) ( ~ x
A
gi l thuc ca x vo A
~

Hm thuc: l hm do ngi quan st cung cp (subjective opinon)
M ho:
Vi mi mi gi tr ngn ng ta gn mt tp m
VD : Tui = Trc 30

Tui = A
~



53

= ) ( ~ x
A
+) 0 vi xe(0,25)
+) 1 vi xe(26,32)
+) 0,7 vi xe(33,38)
+) 0,2 vi xe(39,45)
+) 0 vi x> 45
6.4.2. Cc php ton trn tp m:
Cho tp nn ( tp v tr ) U ( Universer Set)
Mt tp m A
~
trn U c mt m t bi hm thuc ( mebership function)
| | 1 , 0 :
A
U





S= {x/ 0 ) ( > x
A
} Tp gi
K={x/ 1 ) ( = x
A
} Tp core
{ } o
o
> =
A
x A /
Mt s dng thng gp:
Dng 1:








= ) (x
A
+) 0 nu x<a
A

o
U
1
a b c
54

+) | o + x nu a sx sb
+) e + x nu b sx sc
+) 0 nu x>c
A
~
(a, b, c)



Dng 2







A
~
= (a, b, c, d)
Tp m A
~
khng phi l tp theo ngha thng thng nn quan nim A
~
phi nh
ngha theo hm thuc. Do khng biu din bng biu Ven m biu biu din
bng th
Hp ca cc tp m
Cho hai tp m A, B vi
A
v
B
l hai hm thuc tng ng
T ta xy dng 1). B A
~ ~
A C
~

= =

) ( ) ( x x
B A C
max(
) ( ); (
A
x x
B

)





S m

a b c d
55

Ch thch: ly tt c phn trn ca th
Khi hp ca hai tp m l mt tp r
2). C B A
~ ~ ~
= .
= =

) ( ) ( x x
B A C
min (
) ( ); (
A
x x
B

)





Ch thch: By gi ta ly ton b phn di.
3). Phn b:
A
~
vi ) (
A
x khi phn b l: A
~

+) A
~
c hm thuc: ) ( 1 ) (
A
x x
A
=

4). Hiu hai tp hp:
+) B A B A
~ ~ ~
\
~
=
5). Hai tp m bng nhau:
) ( ) ( :
~ ~
x x x B A
B A B A
= = =
Cc tnh cht:
1. Tnh giao hon
A B B A
A B B A
~ ~ ~ ~
~ ~ ~ ~
=
=

2. Tnh kt hp :
) C
~
) B
~
( A
~
C
~
) B
~
A
~
( . . = . .
) C
~
) B
~
( A
~
C
~
) B
~
A
~
( v v = v v
3. Tnh ly ng :
A
~
A
~
A
~
= .
A
~
A
~
A
~
= v
4. A
~
A
~
) B
~
A
~
( = . v
56

A
~
A
~
) B
~
A
~
( = v .
5. Tnh phn phi :
) C
~
A
~
( ) B
~
A
~
( ) C
~
B
~
( A
~
v . v = . v
) C
~
A
~
( ) B
~
A
~
( ) C
~
B
~
( A
~
. v . = v .
6. Tnh cht khc :
| |
~ ~
A
~
= .
u
~
u
~
A
~
= v
7. u
~
~
= |
|
~
u
~
=
8. | = .A
~
A
~

u A A
~
~ ~
= v
9. B
~
A
~
B
~
A
~
. = v

V d : 0.4)} (d, 0.3), (c, 0.2), (b, 0.1), {(a, = A
~

0.6)} (d, 0.7), (c, 0.8), (b, 0.9), {(a, = A
~

0.6)} (d, 0.7), (c, 0.8), (b, 0.9), (a, 0.4), (d, 0.3), (c, 0.2), (b, 0.1, (a, { A= .
~
A
~

Nhn xt : - L. Zadel (max, min, 1-)

*) M RNG PHP TON TP M
- )) x ( ), x ( ( s ) x (
B A B A

A
=
v

Hm s l t conorm :
s : [0, 1] x [0, 1] [0, 1]

- )) x ( ), x ( ( t ) x (
B A B A

A
.
=
Hm t l t norm :
s : [0, 1] x [0, 1] [0, 1]
- Hm t conorm tha mn cc tnh cht :
+ s(x, y) = s(y, x)
+ s(s(x, y), z) = s(x, s(y, z))
+

=
=
x ) , x ( s
) , x ( s
0
1 1

- Hm t norm tha mn cc tnh cht :
+ t(x, y) = t(y, x)
+ t(s(x, y), z) = t(x, s(y, z))
+

=
=
0 0
1
) , x ( t
x ) , x ( t

V d : s(x, y) = x + y - xy
57

t(x, y) = xy
Kim tra :
1. Giao hon : hin nhin
2. Kt hp :
Hm s :
) z ), y , x ( s ( s )) y , x ( s , x ( s =
+ + + = =
+ + + = =

xyz zx yz xy z y x ... z) y), (x, (s s

xyz zx yz xy z y x ... z)) s(y, (x, s

Hm t :
hin nhin
3. Tnh cht cui :
+

= =
= =
x ... ) , x ( s
... ) , x ( s
0
1 1
;

= =
= =
0 0
1
... ) , x (
x ... ) , x (
t
t

- B ba : (s, t, n) ; ] , [ ] , [ : n ) x ( ( n ) x (
A
A
1 0 1 0 =
Hm negation :
1.

=
=
0 1
1 0
) ( n
) ( n

2. n(n(x)) = x
3. n iu : x > y n(x) > n(y)
V d : hm 1 x

- B ba : (s, t, n) thch hp khi :
1. s (x, t (y, z)) = t (s (x, y), s (x, z))
2. t (x, s (y, z)) = s (t (x, y), t (x, z))
3. n ( s (x, y)) = t (n (x), n (y))
4. n ( t (x, y)) = s (n (x), n (y))

6.4.3 Biu din tri thc m :
- Dng lut :
If X
1
= v
1
v X
2
= v
2
v ... v X
n
= v
n
then Y = v
+ v
i
, v : l gi tr ngn ng.
- M ha :
If

1
1 1
U
A
~
X = v

2
2 2
U
A
~
X = v ... v

n
U
n n
A
~
X = then

V
B
~
Y =
*) xt X = A Y = B
- Logic kinh in :
A B A vB
U = {x
1
, ... x
n
} = tp v tr/nn ca A
V = {y
1
, ... y
n
} = tp v tr/nn ca B
- Lut m quan h m tp m trn U x V
. Lut m vect : A ~
A

58

. Tp m ma trn
X = (
1
*
,

2
*
, ... ,
n
*
)
Y = (
1
B
,

2
B
,
, ...,
n
B
)

i
A
=
A
(x
i
)

j
B
=
B
(y
j
)

If X = x
1
then Y = y
1

11

... ...
If X = x
2
then Y = y
m

1m

... ...
If X = x
n
then Y = y
1

n1

... ...
If X = x
n
then Y = y
m

nm


ma trn n x m.
t mt lut X = A Y = B, ta c n x m lut, mi lut c chc chn no
( c khong 37 cch khc nhau)

V d :

- Nguyn tc tnh :
ij
= s (n (
i
A

,
j
B

))
- Nu c 1 lut :
If x = V then Y = U

Ma trn : y
1
y
2
... y
m
x
1

11

12
...

1m
x
2

21

22
...

2m
... ... ... ... ...
x
n

n1

n2
...

nm


- Ngyn tc tnh khc :

ij
=
i
A

.
j
B


ij
= min (
i
A

,
j
B

)
...
- Nu c nhiu lut :
If X = A . Y = B then Z = C
R
C/A, B
= R
C/A
R
C/B

If X = A If Y = B
then Z = C then Z = C

R
C/A
R
C/B

-
ijR
= min (
iR
,
jR
)
59


V d : Xt X = A Y = B
A = (0.1, 0.3, 0.6)
B = (0.1, 0.3, 0.2)
(Min) 0.1 0.1 0.1 (Product) 0.07 0.03 0.02 ( ...
)
0.9 0.9 0.9
0.3 0.2 0.2 0.21 0.03 0.06 0.7 0.7 0.7
0.6 0.3 0.2 0.42 0.18 0.12 0.7 0.4 0.4

- Tri thc m Lut m :
If x
1
=

1
1
U
A .

2
2
U
A . ... .

n
U
n
A then

V
B Y =
Quan h m gia U
1
... U
n
v V :
Tp m trn U
1
x U
2
x ... x U
n
x V
If X = A then Y = B
R
B/A
tp m trn U x V ] , [ V x U :
A / B
1 0
] , [ ) v , u (
A / B
1 0 e

Tp A trn U ] , [ U :
A
1 0
] , [ ) u (
A
1 0 e
Tp B trn V ] , [ V :
B
1 0
] , [ ) v (
B
1 0 e

A / B
= (
A
,
B
)
c hai dng : (x, y) = xy
(x, y) = min(x, y)
A B B Av
(x, y) = s(m(x), y)
Ch : ) y , x ( s max v
) y , x ( t min .
1 x n (x)
(ko theo) ) , ( max
B A
1

7.4 Suy din m. (Fuzzy Inference)

Cho tp lut : R = { r
1
, r
2
, ... , r
m
}
r
i
: left
i
q
i

r
i
: B
~
Y A
~
X ... A
~
X A
~
X
n n
= = . . = . =
2 2 1 1

tri thc v lnh vc.
Bit :
GT (gi thit) = } C
~
U , ... , C
~
U , C
~
U {
l l
= = =
2 2 1 1

60

Cn xc nh :
KL (kt lun) = } D
~
V , ... , D
~
V , D
~
V {
k k
= = =
2 2 1 1

Suy din : lm th no xc nh c
k 2 1
D D D
, ... , , ?

i
D
= ) , ... , , ; , ... , , (
GT R
l m
e e e r r r


2 1 2 1

- Procedure SD ( R : set of rules ;
GT, KL : set of facts ;
var KQ : Boolen ;
vet : set of rules
)
- GT KL

B
~
Y A
~
X ... A
~
X A
~
X
n n
= = . . = . =
2 2 1 1


n n
A
~
X ... A
~
X A
~
X ' = ' ' = ' ' = '
2 2 1 1


) , ... , , ( F B Y
n
A A r B ' ' '
= ' =
1

- Xt :
B
~
Y then A
~
X If = =
A
~
X ' =

B
~
Y ' =

A A / B
R
'



B'

|
|
|
|
|
.
|

\
|
' ' '
'
nm n n
m
m
n
...
... ... ... ...
...
...
) , ... , , (




2 1
2 22 21
1 12 11
2 1

A
~
l tp m trn U = { x
1
, x
2
, ... , x
n
}
B
~
l tp m trn V = { y
1
, y
2
, ... , y
n
}
) x (
i A i
' = '

=
A
' = = ' '
n
k
kj k j B j
y
1
. ) (
trong m
)) , ( (min max
kj k
'

i i
B
~
Y then A
~
X If = =
A / B A B
R
' '
=
61

A
~
X ' =

B
~
Y ' =


) R ( max
i i
A / B A B '
= '
Vt cn
*) Bi ton : Cho mt s lut c th to ra hnh thc duyt lut khng vt cn
hay khng ?
+ Heuristic (TTNT)
+ GT di truyn.
B
~
Y then A
~
X ... A
~
X A
~
X If
n n
= = . . = . =
2 2 1 1


n n
A
~
X ... A
~
X A
~
X ' = ' ' = ' ' = '
2 2 1 1

B
~
Y ' =

n
n A , ... , A / B
~
A A A B
R ) , ... , , (
1
2 1

' ' ' '

=

B
~
Y then A
~
X If
i i
= =

i
A
~
X ' =

n
i
i
B
~
B
~
Y ; B
~
Y
1 =
' = ' = ' =
B
~
Y then A
~
X A
~
X If = = v =
2 2 1 1

A
~
X ' =

n
i
i
B
~
B
~
Y ; B
~
Y
1 =
' = ' = ' =
+) n lut n iu kin
+) a lut n iu kin : Vt cn
+) n lut a iu kin : trc tip
gin tip AND :
OR :
+) a lut a iu kin : Vt cn

*) Suy din m = p dng lin tip nhiu ln Modus Ponen (Fred Forward)

V d :

1. If X = A
1
then Y = B
1
2. If X = A
2
then Y = B
2
3. If X = B
3
then Z = C
3
4. If X = B
4
then Z = C
4
62

5. If X = A
5
then Z = C
5
6. If X = A
6
then Y = B
1
7. If X = A
1
. Y = B
6
then Z = C
7
(b qua lut ny cha xt)

Tp nn X : U = {1, 2, 3}
Tp nn Y : V = {A, b}
Tp nn Z : W = {+, }


1 1
A / B
M

a B
2 2
A / B
M

a b
4 4
B / C
M

a b
(0.6 ; 0.2 ; 0.1) 1 0.6 0.5 1 0.7 0.8 a 0.6 0.7
2 0.3 0.9 2 0.4 0.3 b 0.8 0.5
3 0.2 0.1 3 0.3 0.6


3 3
B / C
M


5 5
A / C
M

a b
(0.6 ; 0.6) a 0.2 0.3 1 0.1 0.2
b 0.9 0.7 2 0.3 0.4
3 0.9 0.3

th :
X Y Z (DAG)
`

x = A
0
= (0.6, 0.2, 0.1)

*) p dng nguyn tc min :
0
0 2
0 1
B 0.6) (0.6, Y
0.6) (0.6, Y ) A , (r MP -
0.5) (0.6, Y ) A , (r MP -
= =
)
`

=
=

0
0 4
0 3
C 0.6) (0.6,
0.6) (0.6, Z ) B , (r MP -
0.6) (0.6, Z ) B , (r MP -
= =
)
`

=
=
Z
0.2) (0.2, Z ) A , (r MP -
0 1
=
max
Z = (0.6, 0.6)

*)
1
0 0 1
B 0.5) (0.6, Y ) A , (r MP - = =
0.6) (0.6,
0.6) (0.6, Z ) B , (r MP -
0.5) (0.6, Z ) B , (r MP -
1
0 4
1
0 3

)
`

=
=

2
0 0 2
B 0.6) (0.6, Y ) A , (r MP - = =
0.6) (0.6,
0.6) (0.6, Z ) B , (r MP -
0.6) (0.6, Z ) B , (r MP -
2
0 4
2
0 3

)
`

=
=

63

0.6) (0.6, Z 0.2) (0.2, ) A , (r MP -
0 5
= =

Chng minh :
...

Tng kt :
1. Biu din tp m ch s m & thao tc
2. Nghin cu v : t norm : .
t conorm : v
n(.) : not
(x, y) :
3. Mu thun : tng minh
khng tng minh
( cha c trong TLTK t tm hiu )
4. D tha (trong tp lut)
5. Duyt / p dng khng vt cn.
6. La chn th hin php ton ph hp.
7. Suy din thao tc trc tip (Linguistic Reasoning)
Bi tp chng 6:
Bi 1: Trnh by ba tp m trong thc t.
Bi 2: Trnh by hai tp m trong thc t, ch ra quan h m gia chng.
Bi 3: Biu din mt h m gm 5 lut.
64

cng n tp

1. Nm vng cu trc v chi tit cc thnh phn ca h chuyn gia.
2. Nm vng cc phng php biu din tri thc
3. Nm vng cc phng php lp lun
4. Nm vng khi nim v cu trc ca h h tr ra quyt nh.
5. Nm vng khi nim v my hc. Phng php xy dng cy nh danh
6. Nm vng logic m v lp lun xp x
65

thi tham kho:

1:

Cu 1 (3 ):
H chuyn gia l g?
Hy cho bit nhng c trng c bn ca mt h chuyn gia.
Cu 2 (4 ): Cho tp cc lut sau R = {r1, ..., r6}
r1: a ^ b -> c r5: c ^ d -> e
r2: b -> c r6: a ^ e -> f
r3: b ^ h -> d r7: e ^ f -> m
r4: a ^ c -> d
a) Tp s kin {a, b} c l c s s kin ca tp s kin cho trong R khng?
b) Vi GT = {a, b}, KL = {m}. Hy p dng k thut suy din a ra kt
lun.
Cu 3 (3 )
Cho lut IF A THEN B vi A = (0, 0.5, 0.6, 0.8, 0) v B = (0, 0.5, 1, 0.5, 0.4),
A' = (0, 0.5, 0, 0, 0). Tm B' bng cch s dng suy din tch cc i.

2:

Cu 1 (3 ):
Trong cu trc ca mt h chuyn gia.
V sao vic phn tch c s tri thc v c ch lp lun (m t suy din) l
quan trng?
Cu 2 (4 ): Cho tp cc lut sau R = {r1, ..., r6}
r1: b ^ c -> a r5: a ^ d -> e
r2: b -> a r6: a ^ e -> k
r3: a ^ h -> d r7: k ^ e -> x
r4: a ^ c -> d
a) Tp s kin {b, c} c l c s s kin ca tp s kin cho trong R khng?
b) Vi GT = {b, c}, KL = {x}. Hy p dng k thut suy din a ra kt
lun.
66

Cu 3 (3 )
Cho lut IF A THEN B vi A = (0, 0.5, 0.6, 0.8, 1) v B = (0, 0.5, 1, 0.5, 0),
A' = (0, 0.5, 0, 0, 0). Tm B' bng cch s dng suy din max - min.

3:

Cu 1 (3 )
a) Nu c im chnh ca h chuyn gia.
b) ngha ca vic xy dng h chuyn gia.

Cu 2 (4 )
Cho min ca cc i tng c cc thuc tnh v c cc gi tri nh sau:
Tc = {nhiu,t}
Mu tc ={trng,en,vng}
Dng ngi ={cao, thp,trung bnh}
1. S dng v t logic biu din cc i tng ny.
2. S dng cc php ton tng qut nh ngha khng gian hc ca cc i
tng
3. Xy dng cc tp mu hun luyn dng P v m N hc nhn dng i
tng l ngi c dng ngi cao s dng c 3 gii thut tho lun trn.

Cu 3 (3 )
Xem xt cc cu sau y:
Hng thch tt c cc loi thc phm
To l thc phm
G l thc phm
Bt c th g mi ngi n v khng b hi l thc phm
Phong n u phng v vn cn sng
Lan n bt c th g Phong n
1. Hy biu din cc s kin trn bng logic v t
2. Chuyn i cc tin cu 1 sang mnh
3. Chng minh Hng thch n u phng s dng phng php hp gii
4. S dng phng php hp gii tr li cu hi:Lan n thc phm no?.

67

4:

Cu 1 (3)
a) Anh (ch) cho nhn xt ca mnh v
Chng trnh = Cu trc d liu + Gii thut
H chuyn gia = C s tri thc + m t suy din
b) Anh (ch) cho bit l do xy dng h chuyn gia.

Cu 2 (4)
S dng thut ton Quinlan rt ra quy lut cho nhng ngi c c im
no c kh i hc hoc khng theo c s d liu bng sau:

Th
t
Tn
ngi
B hoc m
i hc
iu kin
kinh t
Hc lc C
hc thm
Kt
qu
1 Gip C Trung bnh Gii Khng
2 t C Cao Trung bnh C Khng
3 Bnh C Thp Trung bnh C Khng
4 inh Khng Thp Trung bnh Khng Khng
5 Mu C Trung bnh Kh C
6 K Khng Thp Kh Khng Khng
7 Canh C Trung bnh Kh C
8 Tn C Thp Gii C

Cu 3 (3)
Cho = {1, 2, 3, 4, 5}.
A, B l cc tp m trong nh sau:
A = {(1,0), (2,1), (3,0.5), (4,0.3), (5,0.2)}
B = {(1,0), (2,0.5), (3,0.7), (4,0.2), (5,0.4)}
Hy tnh: AB, BA
c
, AB