CC M HNH BIU DIN TRI THC

1.1 Biu din tri thc bng lut dn( lut sinh) 1.1.1 Khi nim: Phng php biu din tri thc bng lut sinh c pht minh bi Newell v Simon trong lc hai ng ang c gng xy dng mt h gii bi ton tng qut. y l mt kiu biu din tri thc c cu trc. tng c bn l tri thc c th c cu trc bng mt cp iu kin & hnh ng : "NU iu kin xy ra TH hnh ng s c thi hnh". Chng hn : NU n giao thng l TH bn khng c i thng, NU my tnh m m khng khi ng c TH kim tra ngun in, v.v Ngy nay, cc lut sinh tr nn ph bin v c p dng rng ri trong nhiu h thng tr tu nhn to khc nhau. Lut sinh c th l mt cng c m t gii quyt cc vn thc t thay cho cc kiu phn tch vn truyn thng. Trong trng hp ny, cc lut c dng nh l nhng ch dn (tuy c th khng hon chnh) nhng rt hu ch tr gip cho cc quyt nh trong qu trnh tm kim, t lm gim khng gian tm kim. Mt v d khc l lut sinh c th c dng bt chc hnh vi ca nhng chuyn gia. Theo cch ny, lut sinh khng ch n thun l mt kiu biu din tri thc trong my tnh m l mt kiu biu din cc hnh vi ca con ngi. Mt cch tng qut lut sinh c dng nh sau:

P1 P2 ... Pn Q
Ty vo cc vn ang quan tm m lut sinh c nhng ng ngha hay cu to khc nhau : Trong logic v t : P1, P2, ..., Pn, Q l nhng biu thc logic. Trong ngn ng lp trnh, mi mt lut sinh l mt cu lnh. IF (P1 AND P2 AND .. AND Pn) THEN Q.

 Trong l thuyt hiu ngn ng t nhin, mi lut sinh l mt php dch:

ONE mt. TWO hai. JANUARY thng mt.

biu din mt tp lut sinh, ngi ta thng phi ch r hai thnh phn chnh sau : (1) Tp cc s kin F(Facts) F = { f1, f2, ... fn } (2) Tp cc quy tc R (Rules) p dng trn cc s kin dng nh sau : f1 ^ f2 ^ ... ^ fi q Trong , cc fi, q u thuc F V d : Cho 1 c s tri thc c xc nh nh sau : Cc s kin : A, B, C, D, E, F, G, H, K Tp cc quy tc hay lut sinh (rule): R1 : A E R2 : B D R3 : H A R4 : E G C R5 : E K B R6 : D E K C R7 : G K F A 1.1.1 C ch suy lun trn cc lut sinh Suy din tin : l qu trnh suy lun xut pht t mt s s kin ban u, xc nh cc s kin c th c "sinh" ra t s kin ny. S kin ban u : H, K R3 : H A {A, H. K } R1 : A E { A, E, H, K } R5 : E K B { A, B, E, H, K } R2 : B D { A, B, D, E, H, K } R6 : D E K C { A, B, C, D, E, H, K }

Suy din li : l qu trnh suy lun ngc xut pht t mt s s kin ban u, ta tm kim cc s kin "sinh" ra s kin ny. Mt v d thng gp trong thc t l xut pht t cc tnh trng ca my tnh, chn on xem my tnh b hng hc u. V d : Tp cc s kin : cng l "hng" hay "hot ng bnh thng" Hng mn hnh. Lng cp mn hnh. Tnh trng n cng l "tt" hoc "sng" C m thanh c cng. Tnh trng n mn hnh "xanh" hoc "chp " Khng s dng c my tnh. in vo my tnh "c" hay "khng". Tp cc lut : R1. Nu ( ( cng "hng") hoc (cp mn hnh "lng")) th khng s dng c my tnh. R2. Nu (in vo my l "c") v ( (m thanh c cng l "khng") hoc tnh trng n cng l "tt")) th ( cng "hng"). R3. Nu (in vo my l "c") v (tnh trng n mn hnh l "chp ") th (cp mn hnh "lng"). xc nh c cc nguyn nhn gy ra s kin "khng s dng c my tnh", ta phi xy dng mt cu trc th gi l th AND/OR nh sau :

Hnh 21: C ch suy din ca suy din li. Nh vy l xc nh c nguyn nhn gy ra hng hc l do cng hng hay cp mn hnh lng, h thng phi ln lt i vo cc nhnh kim tra cc iu kin nh in vo my "c", m thanh cng "khng".Ti mt bc, nu gi tr cn xc nh khng th c suy ra t bt k mt lut no, h thng s yu cu ngi dng trc tip nhp vo. Chng hn nh bit my tnh c in khng, h thng s hin ra mn hnh cu hi "Bn kim tra xem c in vo my tnh khng (kim tra n ngun)? (C/K)". thc hin c c ch suy lun li, ngi ta thng s dng ngn xp ( ghi nhn li nhng nhnh cha kim tra). 1.1.1 Vn ti u lut Tp cc lut trong mt c s tri thc rt c kh nng tha, trng lp hoc mu thun. D nhin l h thng c th li cho ngi dng v vic a vo h thng nhng tri thc nh vy. Tuy vic ti u mt c s tri thc v mt tng qut l mt thao tc kh (v gia cc tri thc thng c quan h khng tng minh), nhng trong gii hn c s tri thc di dng lut, ta vn c mt s thut ton n gin loi b cc vn ny. .

1.1.1.1 Rt gn bn phi Lut sau hin nhin ng : A B A (1) Do lut: A B A C L hon ton tng ng vi A B C Quy tc rt gn : C th loi b nhng s kin bn v phi nu nhng s kin xut hin bn v tri. Nu sau khi rt gn m v phi tr thnh rng th lut l lut hin nhin. Ta c th loi b cc lut hin nhin ra khi tri thc. 1.1.1.2 Rt gn bn tri Xt cc lut : (L1) A, B C (L2) A X (L3) X C R rng l lut A, B C c th c thay th bng lut A C m khng lm nh hng n cc kt lun trong mi trng hp. Ta ni rng s kin B trong lut (1) l d tha v c th c loi b khi lut dn trn. 1.1.1.3 Phn r v kt hp lut: Lut: A B C Tng ng vi hai lut AC BC
Vi quy tc ny, ta c th loi b hon ton cc lut c php ni HOC. Cc lut c php ni ny thng lm cho thao tc x l tr nn phc tp.

1.1.1.4 Lut tha Mt lut dn A B c gi l tha nu c th suy ra lut ny t nhng lut cn li. V d : trong tp cc lut gm {A B, B C, A C} th lut th 3 l lut tha v n c th c suy ra t 2 lut cn li. 1.1.1.5 Thut ton ti u tp lut dn

Thut ton ny s ti u ha tp lut cho bng cch loi i cc lut c php ni HOC, cc lut hin nhin hoc cc lut tha. Thut ton bao gm cc bc chnh: B1 : Rt gn v phi Vi mi lut r trong R Vi mi s kin A VPhi(r) Nu A VTri(r) th Loi A ra khi v phi ca R. Nu VPhi(r) rng th loi b r ra khi h lut dn : R = R \{r} B2 : Phn r cc lut Vi mi lut r : X1 X2 Xn Y trong R Vi mi i t 1 n n R := R + { Xi Y } R := R \ {r} B3 : Loi b lut tha Vi mi lut r thuc R Nu VPhi(r) Baong(VTri(r), R-{r}) th R := R \ {r} B4 : Rt gn v tri Vi mi lut dn r : X : A1 A2, , An Y thuc R Vi mi s kin Ai r Gi lut r1 : X - Ai Y S = (R - {r}) {r1} Nu Baong (X - Ai , S) Baong (X, R) th loi s kin A ra khi X 1.1.2 u im v nhc im ca biu din tri thc bng lut u im: Biu din tri thc bng lut c bit hu hiu trong nhng tnh hung h thng cn a ra nhng hnh ng da vo nhng s kin c th quan st c. N c nhng u im chnh yu sau y: Cc lut rt d hiu nn c th d dng dng trao i vi ngi dng (v n l mt trong nhng dng t nhin ca ngn ng). C th d dng xy dng c c ch suy lun v gii thch t cc lut. Vic hiu chnh v bo tr h thng l tng i d dng.

 C th ci tin d dng tch hp cc lut m. Cc lut thng t ph thuc vo nhau. Nhc im: Cc tri thc phc tp i lc i hi qu nhiu (hng ngn) lut sinh. iu ny s lm ny sinh nhiu vn lin quan n tc ln qun tr h thng. Thng k cho thy, ngi xy dng h thng tr tu nhn to thch s dng lut sinh hn tt c phng php khc (d hiu, d ci t) nn h thng tm mi cch biu din tri thc bng lut sinh cho d c phng php khc thch hp hn! y l nhc im mang tnh ch quan ca con ngi. C s tri thc lut sinh ln s lm gii hn kh nng tm kim ca chng trnh iu khin. Nhiu h thng gp kh khn trong vic nh gi cc h da trn lut sinh cng nh gp kh khn khi suy lun trn lut sinh.

1.1 Mng suy din tnh ton 1.1.1 Khi nim: Mng tnh ton [ l mt dng biu din tri thc c th dng biu din cc tri thc v cc vn tnh ton v c p dng mt cch c hiu qu gii mt s dng bi ton. Mi mng tnh ton l mt mng ng ngha cha cc bin v nhng quan h c th ci t v s dng c cho vic tnh ton. Chng ta xt mt mng tnh ton gm mt tp hp cc bin cng vi mt tp cc quan h (chng hn cc cng thc) tnh ton gia cc bin. Trong ng dng c th mi bin v gi tr ca n thng gn lin vi mt khi nim c th v s vt, mi quan h th hin mt s tri thc v s vt. 1.1.2 Cc quan h Cho M = {x1,x2,...,xm} l mt tp hp cc bin c th ly gi tr trong cc min xc nh tng ng D1,D2,...,Dm. i vi mi quan h R D1xD2x...xDm trn cc tp hp D1,D2,...,Dm ta ni rng quan h ny lin kt cc bin x 1,x2,...,xm, v k hiu l R(x1,x2,...,xm) hay vn tt l R(x) (k hiu x dng ch b bin < x 1,x2,...,xm >). Ta c th

thy rng quan h R(x) c th c biu din bi mt nh x f R,u,v vi u v = x, v ta vit : fR,u,v : u v, hay vn tt l f : u v. i vi cc quan h dng cho vic tnh ton, cch k hiu trn bao hm ngha nh l mt hm: ta c th tnh c gi tr ca cc bin thuc v khi bit c gi tr ca cc bin thuc u. Trong phn sau ta xt cc quan h xc nh bi cc hm c dng f : u v, trong u v = (tp rng). c bit l cc quan h i xng c hng (rank) bng mt s nguyn dng k. l cc quan h m ta c th tnh c k bin bt k t m-k bin kia ( y x l b gm m bin < x1,x2,...,xm >). Ngoi ra, trong trng hp cn ni r ta vit u(f) thay cho u, v(f) thay cho v. i vi cc quan h khng phi l i xng c hng k, khng lm mt tnh tng qut, ta c th gi s quan h xc nh duy nht mt hm f vi tp bin vo l u(f) v tp bin ra l v(f); ta gi loi quan h ny l quan h khng i xng xc nh mt hm, hay gi vn tt l quan h khng i xng. V d: quan h f gia 3 gc A, B, C trong tam gic ABC cho bi h thc: A+B+C = 180 (n v: )

Hnh 22: Quan h 3 gc trong tam gic ABC

1.1.3 Mng tnh ton v cc k hiu

Nh ni trn, ta s xem xt cc mng tnh ton bao gm mt tp hp cc bin M v mt tp hp cc quan h (tnh ton) F trn cc bin. Trong trng hp tng qut c th vit: M = {x1,x2,...,xn}, F = {f1,f2,...,fm}. i vi mi f F, ta k hiu M(f) l tp cc bin c lin h trong quan h f. D nhin M(f) l mt tp con ca M: M(f) M. Nu vit f di dng: f : u(f) v(f) th ta c: M(f) = u(f) v(f). 1.1.4 Bi ton trn mng suy din tnh ton Cho mt mng tnh ton (M,F), M l tp cc bin v F l tp cc quan h. Gi s c mt tp bin A M c xc nh v B l mt tp bin bt k trong M.

Cc vn t ra l: C th xc nh c tp B t tp A nh cc quan h trong F hay khng? Ni cch khc, ta c th tnh c gi tr ca cc bin thuc B vi gi thit bit gi tr ca cc bin thuc A hay khng? Nu c th xc nh c B t A th qu trnh tnh ton gi tr ca cc bin thuc B nh th no? Trong trng hp khng th xc nh c B, th cn cho thm iu kin g c th xc nh c B. Bi ton xc nh B t A trn mng tnh ton (M,F) c vit di dng: A B, trong A c gi l gi thit, B c gi l mc tiu tnh ton ca bi ton.

1.1.1 u im & khuyt im ca mng suy din tnh ton u im: Gii c hu ht cc bi ton GT KL nu nh p ng y cc gi thit cn thit. Thut ton n gin d ci t cho nn vic bo tr h thng tng i n gin. C th xy dng h thng suy lun v gii thch mt cch r rng v d hiu. Khuyt im Do h thng ch bao gm 1 cp (M, F) biu din tri thc nn khi gp phi nhng bi ton phc tp th c th xy ra vic lu tr kh khn v nhp nhng khi qun l. ng thi vic xy dng li thut ton l mt vic tng i kh khn phi bo tr li ton b h thng. i vi cc bi ton m s dng nhiu cc i tng tnh ton bi ton tr nn phc tp, vic gii quyt bi ton bng mng tnh ton tr nn kh khn cho ngi lp trnh.

1.1 Biu din tri thc bng Frame 1.1.1 Khi nim: Frame l mt cu trc d liu cha ng tt c nhng tri thc lin quan n mt i tng c th no . Frames c lin h cht ch n khi nim hng i tng (thc ra frame l ngun gc ca lp trnh hng i tng). Ngc li vi cc phng php biu din tri thc c cp n, frame "ng gi" ton b mt i tng, tnh hung hoc c mt vn phc tp thnh mt thc th duy nht c cu trc. Mt frame bao hm trong n mt khi lng tng i ln tri thc v mt i tng, s kin, v tr, tnh hung hoc nhng yu t khc. Do , frame c th gip ta m t kh chi tit mt i tng.

Di mt kha cnh no , ngi ta c th xem phng php biu din tri thc bng frame chnh l ngun gc ca ngn ng lp trnh hng i tng. tng ca phng php ny l "thay v bt ngi dng s dng cc cng c ph nh dao m hp, ngy nay cc hng sn xut hp thng gn km cc np m hp ngay bn trn v lon. Nh vy, ngi dng s khng bao gi phi lo lng n vic tm mt thit b m hp na!". Cng vy, tng chnh ca frame (hay ca phng php lp trnh hng i tng) l khi biu din mt tri thc, ta s "gn km" nhng thao tc thng gp trn tri thc ny. Chng hn nh khi m t khi nim v hnh ch nht, ta s gn km cch tnh chu vi, din tch. Frame thng c dng biu din nhng tri thc "chun" hoc nhng tri thc c xy dng da trn nhng kinh nghim hoc cc c im c hiu bit cn k. B no ca con ngi chng ta vn lun "lu tr" rt nhiu cc tri thc chung m khi cn, chng ta c th "ly ra" vn dng n trong nhng vn cn phi gii quyt. Frame l mt cng c thch hp biu din nhng kiu tri thc ny.

Hnh 23: Cu trc mt Frame xe hi

1.1.2 Cu trc ca Frame Mi mt frame m t mt i tng (object). Mt frame bao gm 2 thnh phn c bn l slot v facet. Mt slot l mt thuc tnh c t i tng c biu din bi frame. V d : trong frame m t xe hi, c hai slot l trng lng v loi my. Mi slot c th cha mt hoc nhiu facet. Cc facet (i lc c gi l slot "con") c t mt s thng tin hoc th tc lin quan n thuc tnh c m t bi slot. Facet c nhiu loi khc nhau, sau y l mt s facet thng gp.

Value (gi tr) : cho bit gi tr ca thuc tnh (nh xanh, , tm vng nu slot l mu xe). Default (gi tr mc nh) : h thng s t ng s dng gi tr trong facet ny nu slot l rng (ngha l chng c c t no!). Chng hn trong frame v xe, xt slot v s lng bnh. Slot ny s c gi tr 4. Ngha l, mc nh mt chic xe hi s c 4 bnh!

Range (min gi tr) : (tng t nh kiu bin), cho bit gi tr slot c th nhn nhng loi gi tr g (nh s nguyn, s thc, ch ci, ...) If added: m t mt hnh ng s c thi hnh khi mt gi tr trong slot c thm vo (hoc c hiu chnh). Th tc thng c vit di dng mt script. If needed : c s dng khi slot khng c gi tr no. Facet m t mt hm tnh ra gi tr ca slot. 1.1.1 Tnh k tha

Trong thc t, mt h thng tr tu nhn to thng s dng nhiu frame c lin kt vi nhau theo mt cch no . Mt trong nhng im th v ca frame l tnh phn cp. c tnh ny cho php k tha cc tnh cht gia cc frame. Hnh sau y cho thy cu trc phn cp ca cc loi hnh hnh hc c bn. Gc ca cy trn cng tng ng vi mc tru tng cao nht. Cc frame nm di cng (khng c frame con no) gi l l. Nhng frame nm mc thp hn c th tha k tt c nhng tnh cht ca nhng frame cao hn. Cc frame cha s cung cp nhng m t tng qut v thc th. Frame c cp cng cao th mc tng qut cng cao. Thng thng, frame cha s bao gm cc nh ngha ca cc thuc tnh. Cn cc frame con s cha ng gi tr thc s ca cc thuc tnh ny.

Hnh 24: Quan h gia cc i tng hnh hc phng

1.2 M hnh COKB 1.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) 1.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 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}. 1.1.1.1 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. 1.1.1.1 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> ] 1.1.1.2 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: [ < tn quan h > , < loi i tng > , < loi i tng > ,] , {< tnh cht > , < tnh cht >}. 1.1.1.3 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. 1.1.1.4 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. 1.1.1.5 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 : 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.

1.1.1 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>. Cu trc ca cc tp tin lu tr cc thnh phn trong m hnh COKB 1.1.1.1 Cu trc tp tin OBJECTS.txt begin_objects <tn loi i tng 1> <tn loi i tng 2> ------------------end_objects 1.1.1.2 Cu trc tp tin RELATIONS.txt

begin_relations [<tn quan h 1>,<tn loi i tng 1>,<tn loi i tng 2>,],{<tnh cht 1>,<tnh cht 2>,} [<tn quan h 2>,<tn loi i tng 1>,<tn loi i tng 2>,],{<tnh cht 1>,<tnh cht 2>,} ---------------------end_relations

1.1.1.3 Cu trc tp tin HIERARCHY.txt begin_hierarchy [<tn lp i tng cp cao>,<tn lp i tng cp thp>] [<tn lp i tng cp cao>,<tn lp i tng cp thp>] ---------------end_hierarchy 1.1.1.4 Cu trc tp tin OPERATORS.txt
begin_operators [<ton t 1>,<kiu kt qu>,[<kiu ton hng 1>,<kiu ton hng 2>,]] [<ton t 2>,<kiu kt qu>,[<kiu ton hng 1>,<kiu ton hng 2>,]] [<ton t 3>,<kiu kt qu>,[<kiu ton hng 1>,<kiu ton hng 2>,]] --------------------end_operators

Cu trc tp tin OPERATORS_DEF.txt

begin_operators_def begin_define_operator: <ton t 1(k hiu)>(<ton hng 1>,<ton hng 2 >,) <cc tn ton hng > : <kiu ton hng> <cc tn ton hng > : <kiu ton hng> -----------------return <kiu i tng tr v> begin_proc <cc qui tc tnh ton> hay <th tc tnh ton> end_proc end_operators_def

Cu trc tp tin FUNCTIONS.txt

begin_functions <kiu tr v ca hm 1> <tn hm 1>(<loi ca i s 1>,.) {tnh cht ca hm} <kiu tr v ca hm 2> <tn hm 2>(<loi ca i s 2>,.) {tnh cht ca hm} --------------------end_functions

Cu trc tp tin <FUNCTIONS_DEF.txt>

begin_functions begin_function 1: <tn hm>(<i s 1>,.) <cc tn i s > : <kiu ca i s> <cc tn i s > : <kiu ca i s> -----------------result <i tng>: kiu ca i tng tr v begin_proc end_proc properties <cc qui tc tnh ton> hay <th tc tnh ton> end_properties end_function begin_function 2 ------------------end_function ------------------end_functions

Cu trc tp tin <RULES.txt>

begin_rules begin_rule 1 kind_rule = <loi lut>

<cc tn i tng > : <kiu i tng>; <cc tn i tng > : <kiu i tng>; -----------hypothesis_part: {cc s kin gi thit ca lut} end_hypothesis_part goal_part: {cc s kin kt lun} end_goal_part end_rule begin_rule 2 ------------------end_rule -------------------end_rules

Cu trc tp tin <Tn khi nim C-Object>.txt

begin_object: <tn khi nim C-Object>[<i tng nn 1>,<i tng nn 2>,] <cc i tng nn> : <kiu i tng> <cc i tng nn> : <kiu i tng> --------------begin_variables <cc tn thuc tnh > : <kiu thuc tnh> <cc tn thuc tnh> : <kiu thuc tnh> -----------------end_variables begin_constraints <iu kin rng buc> <iu kin rng buc> -------------end_constraints

begin_construct_relations <s kin quan h thit lp> <s kin quan h thit lp> -----------end_construct_relations begin_properties <s kin tnh cht> <s kin tnh cht> --------------------end_properties begin_computation_relations begin_relation 1 flag = 0 hoc 1 Mf ={cc thuc tnh} rf vf =1 ={thuc tnh kt qu nu flag = 0}

expf =` biu thc tnh ton ` cost= <trng s ca s tnh ton> end_relation begin_relation 2 -----------------end_relation -----------------end_computation_relations begin_rules begin_rule 1 kind_rule = <loi lut> <cc tn i tng > : <kiu i tng>; <cc tn i tng > : <kiu i tng>; -----------hypothesis_part: {cc s kin gi thit ca lut}

end_hypothesis_part goal_part: {cc s kin kt lun} end_goal_part end_rule 1 begin_rule 2 -----------------end_rule -----------------end_rules end_object

1.1.2 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 25: S t chc theo m hnh COKB 1.1.3 Ngn ng c t theo m hnh COKB: Ngn ng c t theo m hnh COKB c xy dng biu din cho cc tri thc c dng COKB. Ngn ng ny bao gm cc thnh phn : Tp hp cc k t : ch, s v cc k t c bit. T vng : t kha v tn. Cc kiu d liu : Cc kiu d liu c bn v cc loi c cu trc.

 Cc biu thc v cu. Cc cu lnh. C php quy nh cho cc thnh phn ca m hnh COKB. Mt s cu trc ca cc nh ngha cho cc biu thc, C-Object,relations, facts v functions. nh ngha ca cc biu thc : expr expr term factor ::= ::= ::= ::= expr | rel-expr | logic-expr expr add-operator term | term term mul-operator factor | factor factor | element ^ factor | element element ::= (expr ) | name | number | function-call rel-expr logic-expr ::= ::= expr rel - operator expr logic-expr OR logic-term | logic-expr IMPLIES logic-term| NOT logic-term | logic-term | logic-term ::= logic-term AND logic-primary | logic-primary | logic-primary ::= expr | rel-expr | function-call | quantify-expr |

TRUE | FALSE quantify-expr ::= FORALL(name <, name>*), logic-expr | EXISTS(name), logic-expr nh ngha ca C-Object cobject-type ::= COBJECT name; [isa] [hasa] [constructs] [attributes] [constraints] [crelations] [rules] ENDCOBJECT; nh ngha ca cc quan h c bit: isa ::= ISA: name <, name>*; hasa ::= HASA: [fact-def] nh ngha ca cc s kin: facts ::= fact-def ::= object-type ::= relation ::= FACT: fact-def+ object-type | attribute | name | equation | relation | expression cobject-type (name) | cobject-type (name <, name>* ) relation ( name <, name>+ ) RELATION name; ARGUMENT: argument-def+ [facts] ENDRELATION; nh ngha ca cc quan h c s trong cc s kin: relation-def ::=

argument-def ::= function-def ::=

name <, name>*: type; FUNCTION name; ARGUMENT: argument-def+ RETURN: return-def; [constraint] [facts] ENDFUNCTION;

nh ngha ca cc hm dng 1:

return-def ::=

name: type;

nh ngha ca cc hm dng 2: function-def ::= FUNCTION name; ARGUMENT: argument-def+ RETURN: return-def; [constraint] [variables] [statements] ENDFUNCTION; statements ::= statement-def ::= if-stmt ::= statement-def+ assign-stmt | if-stmt | for-stmt asign-stmt ::= name := expr; IF logic-expr THEN statements+ ENDIF; | IF logic-expr THEN statements+ ELSE statements+ ENDIF; for-stmt ::= FOR name IN [range] DO statements+ ENDFOR;

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

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. 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). 1.1.1 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. 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. 1.1.1 u im ca m hnh COKB Thng qua nhng khi nim v cc m hnh biu din tri thc tiu biu c bit ta thy c mt s u im cng nh nhng khuyt im ca chng. lm r hn ta c bng lit k u khuyt ca cc phng php biu din tri thc: P.Php u im Nhc im

Lut sinh

C php n gin, d hiu, din dch n Rt kh theo di s phn gin, tnh n th cao, linh ng (d iu cp, khng hiu qu trong chnh). nhng h thng ln, khng th biu din c mi loi tri thc, rt yu trong vic biu din cc tri thc dng m t, c cu trc. Mng ng D theo di s phn cp, s d theo cc mi Ng ngha gn lin vi ngha lin h, linh ng mi nh c th nhp nhng, kh x l cc ngoi l, kh lp trnh. Mng tnh Gii c hu ht cc bi ton GT KL Khng gii c cc tri ton nu nh p ng y cc gi thit cn thc phc tp, lu tr kh thit. khn v nhp nhng khi Thut ton n gin d ci t cho nn vic qun l. bo tr h thng tng i n gin. ng thi vic xy dng C th xy dng h thng suy lun v gii li thut ton l mt vic thch mt cch r rng v d hiu. tng i kh khn bo tr li ton b h thng. Frame C sc mnh din t tt, d ci t cc Kh lp trnh, kh suy thuc tnh cho cc slot cng nh cc mi din, thiu phn mm h lin h, d dng to ra cc th tc chuyn tr. bit ha, d a vo cc thng tin mc nh v d thc hin cc thao tc pht hin cc gi tr b thiu st. Bng 21: Bng lit k cc u khuyt ca cc phng php biu din tri thc

Ta nhn thy m hnh biu din tri thc bng Frame l m hnh biu din tri thc tng i i hon thin nht trong tt c cc phng php. Nhng khuyt im ca m hnh l kh lp trnh v thiu phn mm h tr. Trong khi u im ca m hnh COKB l: Cu trc tng minh gip d dng thit k cc mun truy cp c s tri thc. Thch hp cho vic thit k mt c s tri thc vi cc khi nim c th c biu din bi cc i tng tnh ton. Tin li cho vic thit k cc mun gii bi ton t ng. Thch hp cho vic nh dng ra mt ngn ng khai bo bi ton v c t bi ton mt cch t nhin. Vi nhng u im trn m hnh COKB l m hnh l tng biu din tri thc thay th cho cc m hnh biu din tri thc thng thng. Ngoi ra, vi s h tr ca cng c

Maple phn mm i s tnh ton l ngn ng lp trnh chnh h tr mt phn rt ln cho m hnh COKB. V da vo m hnh COKB c trnh by trn s l nn tng xy dng cho ti s c trnh by vo chng tip theo.