I HC QUC GIA TP.

H CH MINH
TRNG I HC CNG NGH THNG TIN

BI THU HOCH CHUYN
BIU DIN TRI THC V NG DNG

ti:

NG DNG M HNH COKB V THUT

GII CHO TRI THC HNH HC GII TCH
HAI CHIU

Ging vin hng dn: PGS.TS. VN NHN

Hc vin thc hin: NGUYN TR PHC
M s: CH1101121

TP. H Ch Minh, thng 1 nm 2013

 MC LC

CHNG 1 TNG QUAN .............................................................................................. 1

1.1. t vn ............................................................................................................... 1
1.2. Mc tiu .................................................................................................................. 1
1.3. Phm vi ................................................................................................................... 1
CHNG 2 M HNH COKB ........................................................................................ 2
2.1. nh ngha v m hnh COKB................................................................................ 2
2.1.1. Tp hp C (cc khi nim v cc C_Object): .................................................. 2
2.1.2. M hnh cho mt i tng tnh ton (C-Object) ............................................ 4
2.1.3. Tp hp H (cc quan h phn cp gia cc i tng) .................................... 4
2.1.4. Tp hp R cc khi nim v cc loi quan h trn cc C-Object .................... 4
2.1.5. Tp hp Opts cc ton t ................................................................................. 5
2.1.6. Tp hp Funcs cc hm .................................................................................... 5
2.1.7. Tp hp Rules cc lut ..................................................................................... 5
2.2. T chc c s tri thc theo COKB ......................................................................... 6
2.3. S t chc c s tri thc .................................................................................... 7
2.4. Cc loi s kin trong m hnh COKB ................................................................... 7
2.5. nh ngha cc bc gii cho m hnh COKB ..................................................... 10
CHNG 3 BIU DIN TRI THC HNH HC 2 CHIU........................................ 12
3.1. M hnh ................................................................................................................. 12
3.1.1. Tp C, tp cc khi nim ................................................................................ 12
3.1.2. S Hasses .................................................................................................. 18
3.1.3. Cc quan h gia cc i tng ..................................................................... 19
3.1.4. Cc ton t Ops .............................................................................................. 20
3.1.5. Cc lut Rules ................................................................................................ 20
3.2. Gii thut ............................................................................................................... 22
3.2.1. nh ngha v s hp nht hai s kin ........................................................... 23
3.2.2. nh ngha v bc gii ................................................................................. 23
3.2.3. Thut gii........................................................................................................ 23
TI LIU THAM KHO .................................................................................................. 25
 1

CHNG 1 TNG QUAN

1.1. t vn

p ng cc nhu cu tra cu v gii ton t ng trn my tnh c nhiu

nghin khoa hc v ng dng tin hc trong ton hc Vit Nam v c trn th gii. Cc
cng trnh ny t c mt s kt qu nht nh. C th k ra nh cng trnh h h tr
hc tri thc v gii ton hnh hc gii tch, mng tnh ton m rng v ng dng trong
phn mm gio dc, mng i tng tnh ton m rng v ng dng trong phn mm gio
dc Cc nghin cu ny tm ra cch t chc, lu tr tri thc v cc m hnh dng
trong qu trnh suy lun gii quyt vn trong mt s min tri thc c th. Trong bi
tiu lun ny em xin thc hin mt nghin cu tm hiu cng nh xy dng, a ra cch
t chc m hnh tri thc v hnh hc gii tch 2 chiu n gin.

1.2. Mc tiu

Bo co ny s hng n vic xy dng mt h thng gii cc bi ton hnh hc

gii tch hai chiu n gin.

1.3. Phm vi

Cc i tng c xt n trong bo co ny l:

- im.
- on thng
- ng thng
- Tam gic
- T gic
 2

CHNG 2 M HNH COKB

2.1. nh ngha v m hnh COKB

M hnh biu din tri thc COKB(Computational Objects Knowledge Base) [4]
l mt m hnh tri thc ca cc i tng tnh ton. M hnh COKB l mt h thng
gm 6 thnh phn chnh c k hiu bi b 6 nh sau:

(C,H,R,Opts, Funcs,Rules)

2.1.1. Tp hp C (cc khi nim v cc C_Object):

Cc khi nim c xy dng da trn cc i tng. Mi khi nim l mt

lp cc i tng tnh ton c cu trc nht nh v c phn cp theo s thit lp
ca cu trc i tng, bao gm:

- Cc i tng (hay khi nim) nn: l cc i tng (hay khi nim)

c mc nhin tha nhn. V d: nh mt s i tng kiu boolean
(logic), s t nhin (natural), s nguyn (integer), s thc (real), tp hp
(set), danh sch (list) hay mt s kiu t nh ngha.
- Cc i tng c bn (hay khi nim) c bn cp 0: c cu trc rng
hoc c cu trc thit lp trn mt s thuc tnh kiu khi nim nn: Cc
i tng(hay khi nim) ny lm nn cho cc i tng(hay cc khi
nim) cp cao hn. V d: i tng DIEM c kiu m t khng c cu
trc thit lp.
- Cc i tng (hay khi nim) cp 1: Cc i tng ny ch c cc
thuc tnh kiu khi nim nn v c th c thit lp trn mt danh
sch nn cc i tng c bn. V d: i tng DOAN[A,B] trong
A, B l cc i tng c bn loi DIEM, thuc tnh a biu th di
on thng c kiu tng ng l real.
- Cc i tng (hay khi nim) cp 2: Cc i tng ny c cc thuc
tnh kiu khi nim nn v cc thuc tnh loi i tng cp 1, c th
 3

c thit lp trn mt danh sch nn cc i tng c bn. V d: i

tng TAMGIAC[A,B,C] trong A, B, C l cc i tng c bn loi
DIEM, cc thuc tnh nh GocA, a, S c kiu tng ng l
GOC[C,A,B], DOAN[B,C], real.
- Cc i tng (hay khi nim) cp n >0: Cc i tng ny c cc
thuc tnh kiu khi nim nn v cc thuc tnh loi i tng cp thp
hn, c th c thit lp trn mt danh sch nn cc i tng cp thp
hn.

Cu trc bn trong ca mi lp i tng:

Kiu i tng: Kiu ny c th l kiu thit lp trn mt danh sch nn

cc i tng cp thp hn.
Danh sch cc thuc tnh ca i tng: Mi thuc tnh c kiu thc,
kiu i tng c bn hay kiu i tng cp thp hn. Phn ra lm 2
loi l tp cc thuc tnh thit lp ca i tng v tp cc thuc tnh
khc (cn gi l tp thuc tnh).
Tp hp cc iu kin rng buc trn cc thuc tnh.
Tp hp cc tnh cht ni ti hay s kin vn c lin quan n cc thuc
tnh ca i tng.
Tp hp cc quan h suy din - tnh ton trn cc thuc tnh ca i
tng. Cc quan h ny th hin cc lut suy din v cho php ta c th
tnh ton mt hay mt s thuc tnh t cc thuc tnh khc ca i tng.
Tp hp cc lut suy din trn cc loi s kin khc nhau lin quan n
cc thuc tnh ca i tng hay bn thn i tng. Mi lut suy din
c dng: {cc s kin gi thit} {cc s kin kt lun}.
 4

2.1.2. M hnh cho mt i tng tnh ton (C-Object)

Mt C-Object c th c m hnh ha bi mt b 6 thnh phn chnh:

(BasicO,Attrs, CRela, Rules, Prop,Cons)

Trong :

- BasicO: l tp hp cc i tng nn ca mt i tng.

- Attrs: l tp hp cc thuc tnh ca i tng.
- CRela: l tp hp cc quan h suy din tnh ton.
- Rules: l tp hp cc lut suy din trn cc s kin lin quan n cc thuc
tnh cng nh lin quan n bn thn i tng.
- Prop: l tp hp cc tnh cht hay s kin vn c ca i tng.
- Cons: l tp hp cc iu kin rng buc.

2.1.3. Tp hp H (cc quan h phn cp gia cc i tng)

Trong tp C, ta c cc quan h m theo c th c nhng khi nim l s

c bit ho ca nhng khi nim khc. C th ni, H l mt biu Hasse trn C
khi xem quan h phn cp l mt quan h th t trn C.

Cu trc ca mt quan h phn cp:

[<tn lp i tng cp cao>, <tn lp i tng cp thp> ]

2.1.4. Tp hp R cc khi nim v cc loi quan h trn cc C-Object

Mi quan h c xc nh bi tn quan h v danh sch cc loi i tng

ca quan h. i vi quan h 2 hay 3 ngi th quan h c th c cc tnh cht nh
tnh phn x, tnh phn xng, tnh i xng v tnh bc cu.

Cu trc ca mt quan h:
 5

[ < tn quan h > , < loi i tng > , < loi i tng > ,] , {< tnh cht > ,
< tnh cht >}.

2.1.5. Tp hp Opts cc ton t

Cc ton t th hin cc qui tc tnh ton nht nh trn cc bin thc cng
nh trn cc i tng. Chng hn nh cc php ton s hc, cc php tnh ton
trn cc i tng on, gc tng t nh i vi cc bin thc hay cc php tnh
ton vecto, tnh ton ma trn, Trong trng hp cc php ton 2 ngi th php
ton c th c cc tnh cht nh tnh giao hon, tnh kt hp,tnh nghch o, tnh
trung ho.

2.1.6. Tp hp Funcs cc hm

Tp hp Funcs trong m hnh COKB th hin tri thc v cc hm hay ni

cch khc l th hin tri thc v cc khi nim v cc qui tc tnh ton trn cc bin
thc cng nh trn cc loi C-Object, c xy dng thng qua cc quan h tnh
ton dng hm. Mi hm c xc nh bi <tn hm>, danh sch cc i s v
mt qui tc nh ngha hm v phng din ton hc.

2.1.7. Tp hp Rules cc lut

Mi lut cho ta mt qui tc suy lun t cc s kin ang bit suy ra c

cc s kin mi thng qua vic p dng cc nh lut, nh l hay cc qui tc tnh
ton no . Mi lut suy din r c th c m hnh ho di dng :

r : {sk1, sk2, ..., skm} {skm+1, skm+2, ..., skn}.

Cu trc ca mt lut:

[ Kind, BasicO, Hypos, Goals]

Trong :
 6

Kind: loi lut.

BaseO: tp cc i tng c bn.
Hypos: tp cc s kin gi thit ca mt lut.

Goals: tp cc s kin kt lun ca mt lut.

2.2. T chc c s tri thc theo COKB

C s tri thc c t chc bi mt h thng tp tin vn bn c cu trc da

trn mt s t kho v qui c v c php, th hin cc thnh phn trong m hnh tri
thc COKB. H thng ny bao gm cc tp tin nh sau:

- Tp tin OBJECT.txt : Lu tr tt c cc khi nim i tng ca c s tri thc.

- Tp tin HIERARCHY.txt: Lu li cc biu Hasse th hin quan h phn cp
c bit ho gia cc loi i tng C-Object.
- Tp tin RELATIONS.txt: Lu tr tt c cc quan h cng nh cc tnh cht gia
cc loi i tng C-Object.
- Tp tin OPERATORS.txt: lu tr cc thng tin, c s tri thc ca thnh phn
ton t trn cc i tng C-Object.
- Tp tin OPERATORS_DEF.txt: Lu tr nh ngha v cc loi ton t hay nh
ngha ca cc th tc tnh ton phc v ton t.
- Tp tin RULES.txt: Lu tr cc h lut trn cc loi i tng v cc s kin
trong c s tri thc.
- Tp tin FUNCTIONS.txt: Lu tr cch khai bo hm, thng tin v hm trn cc
C-Object.
- Tp tin FUNCTIONS_DEF.txt: Lu tr nh ngha v cc hm trn cc i tng
v cc s kin.
- Cc tp tin c tn <tn cc C-OBJECT>.txt: Lu tr cu trc ca i tng <tn
khi nim C-Object>.
 7

2.3. S t chc c s tri thc

Mi lin h v cu trc thng tin trong c s tri thc c th c minh ho trn

s sau y:

Hnh - S t chc theo m hnh COKB

2.4. Cc loi s kin trong m hnh COKB

S kin loi 1: S kin thng tin v loi ca i tng.

Cu trc s kin:

[<i tng>, <loi i tng>]

V d: Tam gic cn ABC c nh ngha nh sau :

[TAMGIAC[A,B,C], TAMGIACCAN].

S kin loi 2: S kin v tnh xc nh ca mt i tng hay ca mt thuc tnh ca

i tng.

Cu trc s kin:

<i tng>|<i tng >.<thuc tnh>

 8

V d: Trong tam gic ABC ta c cc cnh AB, AC, BC v cc gc ABC, gc BAC

v gc ACB c nh ngha nh sau:

Cc cnh: DOAN[A,B], DOAN[A,C], DOAN[B,C].

Cc gc: GOC[A,B,C], GOC[B,A,C], GOC[A,C,B].

S kin loi 3: S kin v tnh xc nh ca mt i tng hay ca mt thuc tnh ca

i tng thng qua biu thc hng.

Cu trc s kin:

<i tng> | <i tng >.<thuc tnh> = <biu thc hng>

V d: DOAN[A,B].a = 5; GOC[A,B,C] = Pi/2.

S kin loi 4: S kin v s bng nhau ca mt i tng hay mt thuc tnh ca i

tng vi mt i tng hay mt thuc tnh khc.

Cu trc s kin:

<i tng> | <i tng >.<thuc tnh> = <i tng> | <i tng >.<thuc
tnh>

V d: DOAN[A,B].a = DOAN[B,C].a, GOC[A,B,C].a = GOC[A,C,B].a.

S kin loi 5: S kin v s ph thuc gia cc i tng v cc thuc tnh ca cc

i tng thng qua mt cng thc tnh ton hay mt ng thc theo cc i tng
hay cc thuc tnh.

Cu trc s kin:

<i tng>|<i tng >.<thuc tnh>=<biu thc theo cc i tng hay thuc
tnh >
 9

V d: CV = DOAN[A,B].a + DOAN[A,C].a + DOAN[B,C].a

S kin loi 6: S kin v mt quan h trn cc i tng hay trn cc thuc tnh ca
cc i tng.

Cu trc s kin:

[<tn quan h>,<object1>,<object2>,]

V d: ["THUOC", M,DOAN[A,B]] im M thuc on AB.

S kin loi 7: S kin v tnh xc nh ca mt hm.

Cu trc s kin: <hm>

V d: TRUNGDIEM(A,B) Hm xc nh trung im ca 2 im A,B.

S kin loi 8: S kin v tnh xc nh ca mt hm thng qua mt biu thc hng.

Cu trc s kin:

<hm> = <biu thc hng>

V d: KHOANGCACH(d1, d2) = 9 Khong cch gia 2 ng thng d1 v d2

bng 9.

S kin loi 9: S kin v s bng nhau gia mt i tng hay thuc tnh vi mt
hm.

Cu trc s kin:

<i tng> | <i tng >.<thuc tnh> = <hm>

V d : GOC[A,B,C] = GOC(d1, d2), H1 = HINHCHIEU(A, d)

S kin loi 10: S kin v s bng nhau ca mt hm vi mt hm khc.

 10

Cu trc s kin:

<hm> = <hm>

V d: KHOANGCACH(d,d1) = KHOANGCACH(d1,d2)

S kin loi 11: S kin v s ph thuc ca mt hm theo cc hm hay

cc i tng khc thng qua mt cng thc tnh ton.

Cu trc s kin:

<hm> = <biu thc theo cc hm hay cc i tng>

V d: GOC(d,d1) = GOC(d,d2) + GOC(d,d3).

S kin loi 12: S kin v s ph thuc gia cc hm hay cc i tng thng qua
mt ng thc theo cc hm hay cc i tng.

Cu trc s kin:

<ng thc theo cc hm hay cc i tng>

V d: GOC(d,d1)+ GOC(d,d3) = GOC[A,B,C].a+GOC(d,d2).

2.5. nh ngha cc bc gii cho m hnh COKB

1. Deduce_from3s: suy ra cc s kin loi 2 t cc s kin loi

2. Deduce_from43s: suy ra cc s kin mi loi 3 t cc s kin loi 3 v 4 bng
cch thay th cc bin trong s kin loi 3 vo s kin loi 4.
3. Deduce_from53s: suy ra cc s kin mi loi 3, 4, 5 t cc s kin loi 3 v 5
bng cch thay th cc bin trong s kin loi 3 vo s kin loi 5.
4. Deduce_from45s: suy ra cc s kin mi loi 3 t cc s kin loi 4 v 5 bng
cch gii h phng trnh.
5. Deduce_from8s: suy ra cc s kin loi 7 t cc s kin loi 8.
 11

6. Deduce_from983s: suy ra cc s kin loi 3, 8 t cc s kin loi 3, 8, 9 bng

cch thay th cc s kin loi 8 (hay s kin loi 3) vo cc s kin loi 9.
7. Deduce_Objects: thc hin suy din v tnh ton bn trong cu trc ca tng i
tng. Cc i tng tham gia vo bc gii c kh nng tham gia vo cc bc
gii c kh nng thc hin cc hnh vi nht nh pht sinh s kin mi, thc
hin suy din tnh ton trn cc thuc tnh ca i tng, bn thn i tng hay
cc i tng lin quan c thit lp trn nn ca i tng.
8. Deduce_from9s: suy ra cc s kin loi 2, 3 , 6, 7, 8 t cc s kin loi 9 bng
cch thc hin tnh ton hm.
9. Deduce_Rules: d tm lut c th p dng c.

10. Deduce_Funcs: d tm hm c th p dng c.

11. Deduce_EqsGoal: gii h phng trnh n gin gm n phng trnh n n.

 12

CHNG 3 BIU DIN TRI THC HNH HC 2 CHIU

3.1. M hnh
3.1.1. Tp C, tp cc khi nim

(1): Cc bin s thc, y l tin u tin ca m hnh.

(2): im: i tng nn.

K hiu: POINT. Mi mt im c cha 2 thuc tnh x vy, c th thuc kiu

thc hoc l mt biu thc khi gii cc bi ton m rng.

(3): Cc i tng c xy dng t cc i tng lp (1) v (2): on thng, ng

thng v gc.

- ng thng (LINE) c mt thuc tnh l phng trnh ng thng.

- on thng (SEGMENT) L s k tha t ng thng nhng c cha
thm 2 i tng thuc loi im (L 2 u mt ca on thng).

(4): Cc i tng c xy dng da trn cc i tng thuc lp (3): Tam gic, t

gic. K hiu: Tam gic TRIANGLE, T gic QUADRANGLE.

TRIANGLE:

- L mt tp 3 im A, B, C.
- di 3 cch: a,b,c (hay BC, AC, AB).
- Cc thuc tnh khc: S,p.

QUADRANGLE:

- L mt tp 4 im A, B, C, D.
- di 4 cnh: AB, BC, CD, DA.
- Cc thuc tnh khc: S,p.
 13

Cu trc chi tit cho tng i tng:

(1) POINT (im):

- Kiu: S cp.
- Thuc tnh: Tn im, ta im (X,Y) thuc kiu thc.
- Quan h: l thuc tnh ca cc i tng cp cao hn.
- iu kin rng but: Mi im c mt tn ring bit(Tc khng tn ti hai im
- trng tn hoc trng ta trong cng mt tp).
- Tnh cht ca i tng:...
- Lut suy din:...

(2) LINE (ng thng):

- Kiu: i tng nn.

- Thuc tnh: Phng trnh ng thng: Ax+By+C=0.
- Quan h: l thuc tnh ca cc i tng cp cao hn.

(3) SEGMENT (on thng):

- Kiu: i tng nn.

- Thuc tnh: Phng trnh ng thng Ax+By+C=0, v hai u mt A v B ca
on thng.
- Quan H: l thuc tnh ca cc i tng cp cao hn.
- Rng but: .

(4) VECTOR (Vec-t):

- Kiu: i tng nn
 14

- Thuc tnh: x, y th hin phng v ln ca vector.

- Quan H: Vector c th c xc nh t mt on thng.

(5) ANGLE (Gc):

- Kiu: i tng nn.

- Thuc tnh: 3 im, tn gc c to bi 3 im. S o gc p.
- Quan h: l thuc tnh ca cc i tng cp cao hn.
- iu kin rng but: Qui c v gc trong v gc ngoi.

Rng but v s o ca gc.

- Tnh cht gc:

- Lut suy din:
- Php ton trn gc:

(6) TRIANGLE (Tam Gic):

- Kiu: i tng cp cao.

- Thuc tnh: 3 im khng thng hng v cc on thng tng ng c to t
cc im ny ngoi ra cn c cc thuc tnh lin quan n bn cht ca tam gic
nh S, P v.v..

POINT[A], POINT[B], POINT[C]: Cc nh ca tam gic.

 15

SEGMENT[AB], SEGMENT[BC], SEGMENT[CA]: Cc cnh ca tam

gic.

ANGLE[BAC], ANGLE[ABC], ANGLE [BCA]: Cc gc ca tam gic.

Ha,Hb,Hc: di cc ng cao.

S,P : Din tch, na chu vi kiu thc.

tin theo di, c th xem ANGLE[ABC] l B, im A l POINT[A]. V

SEGMENT[AB] l c.

- Rng but:
- Quan h suy din:

- Cc lut suy din ni ti tam gic:

 16

* nh l Pitago:

* Xc nh tam gic vung:

* Xc nh tam gic cn:

(7) QUADRANGLE (T gic):

- Kiu: i tng cao cp.

- Thuc tnh: 4 im, 2 ng cho cng cc thuc tnh khc nh p (Chu vi),
- S(Din tch).

POINT[A], POINT[B], POINT[C], POINT[D]: Cc nh ca t gic.

 17

ANGLE[A], ANGLE[B], ANGLE[C], ANGLE[D]: Cc gc ca t gic.

AB, BC, CD, AD: Cc cnh ca t gic (Kiu SEGMENT).

AC, BD: hai ng cho ca t gic (Kiu SEGMENT).

S,p: Din tch, chu vi ca t gic, kiu thc.

- Quan h suy din:

- Cc lut suy din ni ti t gic:

* Song song gia 2 cnh t gic:

(8) PARALLELOGRAM (Hnh bnh hnh):

- K tha t t gic, hnh bnh hnh c tt c cc thuc tnh ca mt t gic (4 im,

4 cnh, 2 ng cho nh trn).
- Rng but:
 18

(9) RECTANGLE (Hnh ch nht):

- K tha t t gic, hnh bnh hnh c tt c cc thuc tnh ca mt t gic (4 im,

4 cnh, 2 ng cho nh trn).
- Rng but:

(10) SQUARE (Hnh vung):

- K tha t t gic, hnh bnh hnh c tt c cc thuc tnh ca mt hnh ch nht

(4 im, 4 cnh, 2 ng cho nh trn).
- Rng but:

3.1.2. S Hasses

M t s phn cp cho tng i tng trong tp C. H nh mt cy. Trong

mt nt s l mt kiu i tng v mi nt s c mt cha (Parent) hay cn gi l
BaseClass (Lp c s). y l tin ta xt xem hai i tng c thuc cng mt
dng hay khng (Cng l tam gic hoc cng l t gic). T ta c th so snh v
thao tc trn cc thuc tnh ca hai i tng ny
 19

3.1.3. Cc quan h gia cc i tng

- Quan h Mt im thuc v mt ng/on thng:

Relation[IN, POINT, LINE], Relation[IN, POINT, SEGMENT]

- Quan h trung im ca mt im i vi mt on thng.

Relation[MID, POINT, SEGMENT]

- Quan h song song gia 2 on thng:

Relation[PARALLEL, LINE, LINE], Relation[PARALLEL, SEGMENT, LINE],

Relation[PARALLEL, SEGMENT, SEGMENT].

- Quan h vung gc gia 2 on thng:

Relation[PERPENDICULAR, LINE, LINE],

Relation[PERPENDICULAR, SEGMENT, LINE],

Relation[PERPENDICULAR, SEGMENT, SEGMENT].

- Quan h bng nhau gia 2 tam gic, hai on thng:

 20

Relation[EQUAL, TRIANGLE, TRIANGLE].

Relation[EQUAL, SEGMENT, SEGMENT] hoc SEGMENT = SEMGENT.

Trong qu trnh pht trin, ta s xy dng cc module kim tra cc iu kin tng
ng ca cc i tng (Vd Hm kim tra bng nhau, vung gc v.v..) v xem y nh
cc hm c s phc v cho vic gii cc bi ton phc tp.

3.1.4. Cc ton t Ops

Cc ton t s hc v cc hm s cp cng p dng i vi cc i tng loi

on thng v cc i tng loi gc.

3.1.5. Cc lut Rules

y l mt phn quan trng trong vic xay dng b suy din, v bn cnh cc quan
h ni ti cc i tng, cc lut ng vai tr nh cc cu ni gia cc i tng v m
ra cc thuc tnh mi thng qua cc lut.

Lut v s tng ng tn gi:

Lut v thuc tnh i tng:

 21

Lut v s song song v vung gc:

Lut v im, on thng:

Lut v xc dnh Vector t on thng:

Lut v s bng nhau gia 2 vector:

 22

Lut v s bng nhau ca hai tam gic.

Lut v trng tm Tam Gic.

3.2. Gii thut

Xt bi ton: . Trong gi thuyt v kt lun l tp hp nhng s kin

trn cc thuc tnh trn cc i tng, bi ton t ra l t Gl c th i dc n KL hay
khng v nu c th ta cn phi i qua nhng bc no c c kt lun.

tng c bn l thc hin mt qu trnh suy din tin kt hp vi mt s qui tc

heuristic nhm tng cng tc gii quyt bi ton v t c mt li gii tt nhanh
hn. thit k thut gii ny ta cn nh ngha mt s khi nim lin quan bao gm
cc khi nim: s hp nht ca cc s kin, mt bc gii, mt li gii v s gii
c.
 23

3.2.1. nh ngha v s hp nht hai s kin

Ta ni 2 s kin f1 v f2 c xem l tng ng nhau nu chng c v tri ging

nhau v gi tr v phi bng nhau.

3.2.2. nh ngha v bc gii

Xt bi ton : . , trong GT v KL l cc tp hp nhng s kin trn cc

thuc tnh ca mt i tng C-Object. Ta gi mt dy cc bc gii l
mt li gii ca bi ton khi ta c , vi FACTS l tp hp tt c cc s kin
c c sau khi ta ln lt p dng cc bc gii s1, s2, ... , sm xut pht t tp s kin
GT v quan h c hiu theo ngha l bao hm hp nht (tc l mi s kin trong
KL u hp nht c vi mt s kin no trong FACTS). Ta s ni rng bi ton l
gii c khi tn ti mt li gii cho bi ton.

3.2.3. Thut gii

Cho bi ton , trong GT v KL l cc tp hp nhng s kin trn

cc thuc tnh ca mt i tng C-Object. Ta c th xt tnh gii c ca bi ton
trn theo th tc sau y:

Bc 1: t trng thi ban u cho tp s kin <FactSet>, v bin <found> c

kiu Bool cho bit kt qu xem xt s gii c ca bi ton:

FactSet ;

If KL FactSet then Found true

Else Found false;

 24

Bc 2: Thc hin mt qu trnh d tm cch suy din tnh ton pht sinh
(hay suy ra) s kin mi:

While not found do

- Tm kim mt dng suy lun c th p dng c trn tp s kin FactSet

sinh ra
- s kin mi.
- If (tm kim tht bi) then break; (ngt lp while)
- S S Si; (Cp nht bc gii mi).
- Gi tp cc s kin mi l <news> trong trng hp tm kim thnh cng.

If KL FactSet then found true;

end do;

Bc 3: If found then Bi Ton C th gii c

Else Bi ton khng gii c;

 25

TI LIU THAM KHO

[1] Nhon Do Van, A system supports studying knowlegde and solving analytic
Geometry problems. P.O.Box 3058 - Macau, 2000.

[2] Nhon Do Van, Extensive Computational Networks and Applying in an

Educational software. Wuhan, P. R. China, August. 22-23, 2009.

[3] Nhon Do Van, Tam Pham Huu, The Extensive C-Objects Network And Applying
in an Educational Software. Wuhan, P. R. China, August. 22-23, 2009.

[4] Hong Kim, Vn Nhn M rng v pht trin m hnh tri thc cc i
tng tnh ton K hiu hi tho Quc gia Nng 18-20 thng 8 nm 2004.

[5] Hong Kim , Vn Nhn (2005), M rng v pht trin m hnh tri thc cc
i tng tnh tan, Nh xut bn Khoa Hc K Thut.