TH KHI NIM 1.

nh ngha:
th khi nim l mt th hu hn, lin thng, cc nh c chia lm hai loi: nh khi nim v nh quan h. nh khi nim: dng biu din cc khi nim c th (ci, in thoi, ) hay tru tng (tnh yu, p, vn ho,). nh khi nim c biu din bi hnh ch nht c gn nhn l khi nim. nh quan h: dng ch ra quan h gia cc khi nim c ni n n. Trong th khi nim: ch c khc loi mi ni c vi nhau. Chnh v dng nh quan h nn cc cung khng cn phi c gn nhn na. Mi th khi nim biu din mt mnh n. C s tri thc: cha nhiu th khi nim.

Loi, c th, tn: Trong th khi nim, mi nh quan h biu din cho mt c th n l thuc mt loi no . ni ln quan h gia loi-c th, nn mi nh khi nim c quy nh cch gn nhn l: loi: tn_c_th tn_ c_th c th l: 1. Mt tn no , nh: sinhvin: nam mt sinh vin c tn l Nam. 2. Mt kho phn bit, c vit theo c php #kho, nh sinhvin: #59701234 mt sinh vin c kho l: 59701234.

3. C th dng du sao (*) ch ra mt c th cha xc nh, nh: sinhvin: * , c tc dng nh sinhvin ch ra mt sinh vin bt k sinhvin:*X sinh vin bt k, tn sinh vin c ly qua bin X. sinhvin:ng* sinh vin c tn bt u bi ng Trng hp 1 v 2, khi nim c gi l khi nim c th, trng hp 3 ta c khi nim tng qut.

2.Phn cp loi (type)

Nu c s v t l hai loi (type) th: st: s: subtype ca t t : supertype ca s

V d: - sinhvin l subtype ca ngi. - ngi l super type ca sinhvin. nn vit: sinhvin ngi Trong s phn cp bn, s: c gi l common-subtype ca r v v. v : c gi l common-supertype ca s v u. T : supertype ca mi type : subtype ca mi type

3.Cc php ton trn th khi nim.

Xt hai th sau: Php copy (nhn bn): nhn bn mt th. Php Restriction (gii hn): to ra th mi bng cch: t mt th c, thay th mt nh khi nim bi mt nh khc c th hn, nh hai trng hp: Mt bin *, c thay th bi mt kho, hay mt tn ca c th. VD: dog:* dog:#123 hay dog:luu Mt type c thay th bi subtype ca n. VD: ngi: nam sinhvin:nam

p dng php restriction trn th G2, c th dn ra G3 nh sau:

Php Join (ni): Ni hai th c mt th khc. Nu c nh khi nim C xut hin trn c hai th X v Y, th chng ta c th ni hai th trn nh chung C ni trn, nh t G1 v G3 c th to ra G4 nh sau: (ni trn nh chung l: dog:lulu).

Php simplify: (rt gn) Nu trn mt th c hai th con ging nhau hon ton th chng ta c th b i mt to ra mt th mi c kh nng biu din khng thay i. T G4 c th sinh ra G5 cng kh nng biu din.

Nhn xt: Php Restriction v php Join cho php chng ta thc hin tnh tha k trn th khi nim. Khi thay mt bin * bi mt c th c th, lc chng ta cho php c th tha k cc tnh cht t loi(type) ca n, cng tng t khi ta thay th mt type bi subtype ca n.

4.nh mnh :
thun tin biu din cho cc cu gm nhiu mnh , th khi nim c m rng c th cha c mt mnh trong mt nh khi nim, lc chng ta gi l nh mnh . Vy nh mnh l mt nh khi nim c cha mt th khi nim khc. Xt th khi nim m rng biu din cho cu: Tom believes that Jane likes pizza.

5. th khi nim v logic.

- Php hi (and) ca nhiu khi nim, mnh chng ta c th thc hin d dng cch cch ni nhiu th bi php ton join. - Php ph nh(not) v php tuyn(or) gia cc khi nim hay mnh cng c th c th hin bng cch a vo nh quan h c tn: neg(ph nh), or(tuyn) nh dng sau.

V d: Cu: There are no pink dogs, c biu din:

Trong th khi nim, cc khi nim tng qut (nh dng bin * - nh dog:*, hay ch c tn loi - nh dog) c xem nh c lng t tn ti (). Do vy, mnh trong v d trn c biu din v t l: X Y(dog(X) ^ color(X,Y) ^ pink(Y)). V ton b th ( bao gm nh quan h :neg), c biu din v t: X Y(dog(X) ^ color(X,Y) ^ pink(Y)). = XY( (dog(X) ^ color(X,Y) ^ pink(Y))).

6.Gii thut chuyn mt th khi nim sang biu din v t:

1. Gn mt bin ring bit (X1, X2,) cho mi khi nim tng qut. 2. Gn mt hng cho mi khi nim c th trong th. Hng ny c th l tn c th hay kho ca n. 3. Biu din mt nh khi nim bi mt v t mt ngi; c tn l tn loi (type), i s l bin hay hng va gn trn. 4. Biu din mi nh quan h bi mt v t n ngi; c tn l tn ca nh quan h, cc thng s l bin hay hng c gn cho cc nh khi nim ni n n.

5. . Hi ca tt c cc cu trong bc 3 v 4. Tt c cc bin trong biu thc thu c u nh km lng t tn ti. V d: c th nh sau:

c chuyn sang l: X1(dog(luu) ^ color(X1) ^ brown(X1))