Tr Tu Nhn To

Nguyn Nht Quang

quangnn-fit@mail.hut.edu.vn
Trng i hc Bch Khoa H Ni
Vin Cng ngh Thng tin v Truyn thng
Nm hc 2012-2013

Ni dung mn hc:

Gii thiu v Tr tu nhn to

Tc t

Gii quyt vn : Tm kim, Tha mn rng buc

Logic v suy din

Biu din tri thc

Biu din tri thc khng chc chn

Hc my

Tr tu nhn to

Gii thiu v logic

g

Logic l ngn ng hnh thc cho php (gip) biu din thng
ttin d
di d
dng
g cc kt
t lun
u c tth
c a ra
a

Logic = Syntax + Semantics

C php (syntax): xc nh cc mnh (sentences)

trong mt ngn ng

Ng ngha (semantics): xc nh ngha" ca cc mnh

trong mt ngn ng

Tc l, xc nh s ng n
ca mt mnh

V d: Trong ngn ng ca ton hc

(x+2 y) l mt mnh ; (x+y > {}) khng phi l mt mnh

(x+2 y) l ng nu v ch nu gi tr (x+2) khng nh hn gi tr y
(x+2 y) l ng khi x = 7, y = 1
(x+2 y) l sai khi x = 0,
0 y=6
Tr tu nhn to

C p
php
p ca mt logic
g

C php = Ngn ng + L thuyt chng minh

Ngn ng (Language)

Cc k hiu (symbols), biu thc (expressions), thut ng (terms),

cng thc (formulas) hp l
E.g., one plus one equal two

L thuyt chng minh (Proof theory)

Tp hp
T
h cc
llut
t suy din
di cho
h php
h chng
h minh
i h ((suy llun
ra)) cc

biu thc
V d: Lut suy din any plus zero any

Mt nh l (theorem) l mt mnh
logic cn
chng minh

Vic chng minh mt nh l khng cn phi xc nh ng ngha

(interpretation) ca cc k hiu!
Tr tu nhn to

Ng
g ngha
g ca mt logic
g

Ng ngha = ngha (din gii) ca cc k hiu

V d
d

I(one) ngha l 1 ( N)
I(two) ngha l 2 ( N)
I(plus) ngha l php cng + : N x N N
I(equal) ngha l php so snh bng = : N x N {true, false}
I(one plus one equal two) ngha l true

Nu din gii ca mt biu thc l ng (true), chng ta

ni rng php din gii ny l mt m hnh (model) ca
biu thc

Mt biu thc ng i vi bt k php din gii no th

c gi l mt biu thc ng n (valid)

V d: A OR NOT A
Tr tu nhn to

Tnh bao hm

Tnh bao hm c ngha l mt ci g tun theo (b hm

cha ngha
g
bi)) mt
ci g
g khc:
KB

Mt c s tri thc KB bao hm (hm cha) mnh

nu v ch nu l ng trong mi m hnh (th gii)
m trong KB l ng Tc l: nu KB ng, th
cng
gp
phi ng
g

V d: Nu mt c s tri thc KB cha cc mnh i bng A

thng v i bng B thng, th KB bao hm mnh
i bng A hoc i bng B thng
V d: Mnh (x+y = 4) bao hm mnh (4 = x+y)

Tnh bao hm l mi quan h gia cc mnh da trn

ng ngha
Tr tu nhn to

Cc m hnh

Cc nh logic hc thng hay xem

xt cc s vic theo cc m hnh
(models)

Cc m hnh l cc khng gian (th

gii) c cu trc, m trong cc khng
gian tnh ng n (ca cc s
vic) c th nh gi c

nh ngha: m l mt m hnh ca
mnh nu l ng trong m

M() l tp hp tt c cc m hnh
ca

KB nu v ch nu M(KB) M()

V d: KB = i bng A thng v
i bng B thng, = i bng
A thng
thng
Tr tu nhn to

Suy din logic

g (1)

KB i

Mnh c suy ra t KB bng cch p dng th tc (suy

din) i
(Ni cch khc) Th tc i suy ra mnh t KB

Tnh ng n (soundness)

Mt th tc suy din i c gi l ng n (sound), nu th tc

i suy ra ch
h cc
mnh
h c

b hm
bao
h (entailed
( t il d sentences)
t
)
Th tc i l ng n, nu bt c khi no KB i , th cng ng
i vi KB
Nu th tc i suy ra mnh , m khng c bao hm trong
KB, th th tc i l khng ng n (unsound)

Tr tu nhn to

Suy din logic

g (2)

Tnh hon chnh (completeness)

Mt th tc
t suy din
di i c

gii l hon
h chnh
h h (complete),
(
l t ) nu

th tc i c th suy ra mi mnh c bao hm (entailed

sentences)
Th tc
t i l hon
h chnh,
h h nu
bt c
khi no
KB , th cng
ng

i vi KB i

(Trong phn tip theo ca bi ging) chng ta s xt n

logic v t bc 1 (first-order logic)

C kh nng biu din (din t) hu ht cc pht biu logic

Vi logic v t bc 1, tn ti mt th tc suy din ng n v
hon chnh

Tr tu nhn to

Suy din logic

g (3)

Logic l mt cch biu din hnh thc v suy din t

ng

Vic suy din (reasoning) c th c thc hin mc

c php (bng cc chng minh): suy din din dch
(deductive reasoning)

Vic suyy din c th c thc hin mc ng

g ngha
g
(bng
cc m hnh): suy din da trn m hnh
(model-based reasoning)

Tr tu nhn to

10

Suy din logic

g (4)

Suy din ng ngha mc ca mt php din gii (m

hnh):
)

Vi mt biu thc, c tn ti mt m hnh khng?: c

th tha mn c (satisfiability)
Vi mt biu thc v mt php din gii, kim tra xem
php din gii c phi l mt m hnh ca biu thc
g kim tra m hnh ((model checking)
g)
khng?:

Suy din ng ngha mc ca tt c cc php din gii

c th: kim tra tnh ng n (validity checking)

Logics that are sound (correct) and complete:

provability corresponds to validity

Tr tu nhn to

11

Logic
g nh C p
php
p (1)

Logic nh (propositional logic) l loi logic n gin

nht

Biu thc nh (propositional formula)

Mt k hiu
hi nh
h (S1, S2, )) l mt
t biu
bi thc
th (nh
( h )
Cc gi tr hng logic ng (true) v sai (false) l cc biu
thc
Nu S1 l mt biu thc, th (S1) cng l mt biu thc
(Php ph nh)

Tr tu nhn to

12

Logic
g nh C p
php
p (2)

Biu thc nh (propositional formula)

Nu S1 v
N
S2 l cc
bi
biu th
thc, th (S1 S2) cng
l mt
t
biu thc (Php kt hp / v)
Nu S1 v S2 l cc biu thc, th ((S1 S2) cng
g l mt

biu thc (Php tuyn / hoc)

Nu S1 v S2 l cc biu thc, th (S1 S2) cng l mt
biu thc (Php suy ra / ko theo)
Nu S1 v S2 l cc biu thc, th (S1 S2) cng l mt
biu thc (Php tng ng)
Khng g khc (cc dng trn) l mt biu thc

Tr tu nhn to

13

C p
php
p ca logic
g nh V d

t
true

false

(p) true

((p)
(( p) false)

(p) (((p) false))

(p (q r)) (p q) (p r)
Tr tu nhn to

14

Th t u tin ca cc ton t logic

g

Th t u tin ca cc ton t logic (t cao xung thp)

, , , ,

S dng cp k t () xc nh mc u tin

Cc v d

pqr

tng ng (p q) r ch khng phi p (q r)

p q

tng ng (p) q ch khng phi (p q)

p q r tng ng (p (q)) r ch khng phi

p ((q r)) hoc p ((q) r)

Tr tu nhn to

15

Logic
g nh Ng
g ngha
g (1)

Vi mt m hnh (model) c th, n s xc nh gi tr

ng/sai
g
cho mi k hiu
nh

V d: Vi 3 k hiu S1, S2 v S3, th c th ly v d
mt m hnh m1 xc nh nh sau:
m1 (S1=sai,
i S2=ng,

S3=sai)
i)

Vi 3 k hiu nh nh v d trn, c th ch ra 8 m
hnh c th

Tr tu nhn to

16

Logic
g nh Ng
g ngha
g (2)

Ng ngha ca mt m hnh m = Cc quy tc nh gi

gi tr chn l ((ng/sai)
g
g
) ca cc mnh
trong
g m hnh
m
S1 l ng, khi v ch khi S1 l sai
S1 S2 l ng,
ng khi v ch khi S1 l ng v S2 l ng
S1 S2 l ng, khi v ch khi S1 l ng hoc S2 l ng
S1 S2 l ng, khi v ch khi S1 l sai hoc S2 l ng
l sai, khi v ch khi S1 l ng v S2 l sai
S1 S2 l ng, khi v ch khi S1S2 l ng v S2S1 l ng

V d:
d Vi m
hnh
h h m1 nh
h trong v d
d trn,
th
h gi
i tr ca

biu thc logic nh sau s l:

S1 (S2 S3) = ng (ng sai) = ng ng = ng
Tr tu nhn to

17

Ng ngha ca logic nh V d (1)

Xt m hnh m1 (p=ng, q=sai), ta c ng ngha (gi

tr logic)
g ) ca cc biu thc sau

p l sai

q l ng

p q l sai

p q l ng

p q l sai

q p l ng

p q l sai

p q l ng

Tr tu nhn to

18

Ng ngha ca logic nh V d (2)

Xt m hnh m2 (p=sai, q=ng), ta c ng ngha (gi

tr logic)
g ) ca cc biu thc sau

p l ng

q l sai

p q l sai

p q l ng

p q l ng

q p l sai

p q l sai

p q l ng

Tr tu nhn to

19

Bngg chn l i vi cc ton t logic

g
S1

S2

S
S1

sai

sai

ng

sai

sai

ng

ng

sai

ng

ng

sai

ng

ng

sai

ng

sai

sai

sai

ng

sai

sai

sai

ng

ng

ng

ng

ng ng

S1S2 S1VS2 S1S2 S1S2

Tr tu nhn to

20

Tngg ngg logic

g

Hai mnh c gi l tng ng logic khi v ch khi hai

mnh
nyy lun ng
g trong
g cng
g m hnh: khi v ch
khi v

Tr tu nhn to

21

Biu din bngg logic

g nh V d

Gi s chng ta c cc nh sau

p Chiu
Chiu nay tri nng
nng
q Thi tit lnh hn hm qua
r Ti s i bi
s Ti s
i bng
b
t Ti s v n nh vo bui ti

Biu din cc pht biu trong ngn ng t nhin

Chiu nay tri khng nng v thi tit lnh hn hm qua: p q

Ti s i bi nu nh chiu nay tri nng: p r
N ti (s)
Nu
( ) khng
kh i bi
b i th ti s
i bng:
b r s
Nu ti (s) i bng th ti s v nh vo bui ti: s t

Tr tu nhn to

22

Mu thun v Tautology
g

Mt biu thc logic nh lun c gi tr sai (false) trong

mi php din gii (mi m hnh) th c gi l mt
mu thun (contradiction)

V d: (p p)

Mt biu thc logic nh lun c gi tr ng (true)

trong mi php din gii (mi m hnh) th c gi l
mt
t tautology
t t l

V d:

(p p)
(p
(p q) (p
( p q)
q)
(p q) (p q)

Tr tu nhn to

23

Tnh tha mn c v Tnh ng n

Mt biu thc logic nh l tha mn c

((satisfiable),
), nu biu thc ng
g trong
g mt
m mnh
no

Mt biu
bi thc
th l khng
kh th tha
th mn
c

(unsatisfiable), nu khng tn ti bt k m hnh no m

trong biu thc l ng

V d: A B, A B

V d:
d A A
A

Mt biu thc l ng n (valid), nu biu thc ng

trong mi m hnh

V d: ng; A A; A A; (A (A B)) B

Tr tu nhn to

24

Bi ton chngg minh logic

g

Vi mt c s tri trc (mt tp cc mnh ) KB v mt

mnh cn chng minh (gi l mt nh l)
C s tri thc KB c bao hm (v mt ng ngha) hay
khng:
g KB
?

Ni cch khc, c th c suy ra (c chng minh) t c s

tri thc KB hay khng?

Cu hi t ra:
C
ra Liu
Li c tn ti mt th tc
t c (suy
(s din) c
th gii quyt c bi ton chng minh logic, trong mt
s hu hn cc bc?

i
vi logic nh ,
cu tr li l c!

Tr tu nhn to

25

Gii qquyt bi ton chngg minh logic

g

Mc ch: tr li cu hi KB ?

C 3 phng php (chng minh) ph bin:

S dng bng chn l (Truth-table)

p dng cc lut suy din (Inference rules)

Chuyn v bi ton chng minh tha mn (SAT)

Phng php chng minh bng phn chng

(Resolution/Refutation)

Tr tu nhn to

26

Chngg minh da trn bngg chn l (1)

Bi ton chng minh: KB ?

Kim tra tt c cc php din gii c th (tt c cc m hnh

c th) m trong KB l ng, xem ng hay sai

Bng chn l: Lit k cc gi tr chn l (ng/sai) ca cc

mnh
h ,
i vi
i tt c
cc
php
h din
di gii
ii c
th

Cc php gn gi tr ng/sai i vi cc k hiu nh

KB
p

pq

pq

(p q) q

ng

ng

ng

ng

ng

ng

sai

ng

sai

sai

sai

ng

ng

sai

sai

sai

sai

sai

ng

sai

Tr tu nhn to

chng minh

27

Chngg minh da trn bngg chn l (2)

KB = (p r) (q r)

= (p q)

KB ?
p

pr

q r

KB

ng

ng

ng

ng

ng

ng

ng

ng

ng

sai

ng

ng

ng

ng

ng

sai

ng

ng

sai

sai

ng

ng

sai

sai

ng

ng

ng

ng

sai

ng

ng

ng

ng

ng

ng

sai

ng

sai

sai

ng

sai

ng

sai

sai

ng

ng

sai

sai

sai

sai

sai

sai

sai

ng

sai

sai

Tr tu nhn to

28

Chngg minh da trn bngg chn l (3)

i vi logic nh , phng php chng minh da trn

bng chn l c tnh ng n (sound) v hon chnh
(complete)

phc tp tnh ton ca phng php chng minh

da trn bng chn l

Hm m i vi s lng (n) cc k hiu nh : 2n

Nhng ch c mt tp con (nh) ca tp cc kh nng gn gi tr
chn l, m trong KB v l ng

Tr tu nhn to

29

Chngg minh bngg cc lut suy din (1)

Lut suy din Modus ponens

p q, p
q

Lut suy din loi b lin kt V (And-Elimination)

p1 p2 pn
(i=1..n)
pi

Lut suy din a vo lin kt V (And-Introduction)

p1, p2, , pn
p1 p2 pn

Lut suy din a vo lin kt HOC (Or-Introduction)

pi
p1 p2 pi pn
Tr tu nhn to

30

Chngg minh bngg cc lut suy din (2)

Lut suy din loi b ph nh hai ln (Elimination of Double

Negation)
egat o )
p
p

Lut suy din

hp gii (Resolution)
p q, q r
pr

Lut suy din hp gii n (Unit Resolution)

p q, q
p

Tt c cc lut suy din trn u c tnh ng n (sound)!

Tr tu nhn to

31

Chng minh bng lut suy din V d (1)

Gi s c tp gi thit KB
1) p q
2) p r
3)) (q r)) s

Cn chng minh nh l s

T 1) v
s dng
d ng lut
l t And-Elimination,
And Elimination ta c:
c
4) p

T 2),
2) 4)
4), v s dng lut Modus Ponens
Ponens, ta c:
5) r

Tr tu nhn to

32

Chng minh bng lut suy din V d (2)

T 1), v s dng lut And-Elimination, ta c:

6) q

T 5), 6), v s dng lut And-Introduction, ta c:

7) (q r)

T 7), 3), v s dng lut Modus-Ponens, ta c:

8) s

Vy nh l (biu thc logic) s c chng minh l ng!

Tr tu nhn to

33

Suy din logic

g v Tm kim

chng minh nh l l ng i vi tp gi thit KB, cn

p d
dng
g mt
t cchui
u cc lut
ut suy d
din

ng
g
n
Vn : bc suy din tip theo, c nhiu lut c th p
dng c

Chn lut no
p dng tip
theo?

y l vn ca bi ton tm kim (search)

KB

pq
rs
p
r

p q, p
q
?

Tr tu nhn to

r s, r
s
34

Chuyn i cc biu thc logic

g

Trong logic nh

Mt biu
bi thc
th c
th bao
b gm
nhiu
hi lin
li kt:
kt , , , ,

Mt biu thc c th bao gm nhiu biu thc con (lng) khc

Chng ta c cn
s
dng tt
c
cc lin kt
logic
biu

din mt biu thc phc tp?

Khng.
Chng ta c th vit li (chuyn i) mt biu thc logic nh
thnh mt biu thc tng ng ch cha cc lin kt , ,

Tr tu nhn to

35

Cc dngg chun

Cc biu thc trong logic nh c th c chuyn i

v mt
trong
g cc dng
g chun ((Normal forms))

Dng chun kt hp (Conjunctive normal form CNF)

Gip n gin ha qu trnh suy din

L kt hp (lin kt V) ca cc mnh (clauses)
Mi mnh (clause) l mt lin kt HOC ca cc k hiu nh
n
V d: (p q) (q r s)

Dng chun tuyn (Disjunctive normal form DNF)

L lin kt HOC ca cc mnh (clauses)

Mi mnh (clause) l mt lin kt V ca cc k hiu nh
n
V d: (p q)
q) (p
( p r) (r s)
s)
Tr tu nhn to

36

Chuyn i v dng chun CNF V d

Chuyn i v dng chun CNF: (pq) (rp)
1. Loi b cc lin kt ,

(p q) (r p)
2. S dng cc php bin
i
tng ng (vd: lut

DeMorgan v php ph nh 2 ln)

(p q) (r p)

3. S dng cc lut kt hp (associative rules) v phn b

(distributive rules)
(p r p) (q r p)
(p r) (q r p)
Tr tu nhn to

37

Bi ton chngg minh tha mn (SAT)

Mc ch ca bi ton chng minh tha mn (Satisfiability SAT- p

S
problem)
ob e ) l
xc
c
nh mt
t b
biu
u tthc
c d
dng
g cchun
u kt
t hp
p
(CNF) c th tha mn c hay khng

Tc l chng minh biu thc l ng hay khng

V d
d: (p q r)) ((p
p r s) ((p
p q t)
t)

y l mt trng hp ca bi ton tha mn rng buc (CSP)

Tp cc bin
Cc k hiu nh (v d: p, q, r, s, t)
Cc gi tr (hng) logic ng, sai
Tp cc
T
rng
buc
b
Tt c cc mnh (c lin kt bi php V) trong biu thc
phi ng
Vi mi
i mnh
h ,
t nht
ht mt
t trong
t
cc
nh
h n
phi
hi ng

Tr tu nhn to

38

Gii qquyt bi ton SAT

Phng php Backtracking

p dng chin lc tm kim theo chiu su (Depth

(Depth-first
first search)
Xt mt bin (mt nh n), xt cc kh nng gn gi tr (ng/sai)
cho bin
Lp li, cho n khi tt c cc bin c gn gi tr, hoc vic gn gi tr
cho tp con ca tp tt
c cc bin,
lm cho biu
thc l sai

Cc phng php ti u ha lp (Iterative optimization

methods)

Bt u vi mt php gn ngu nhin cc gi tr ng/sai cho cc k hiu

nh
i g
gi tr ((ng
g thnh sai / sai thnh ng)
g) i vi mt bin
Heuristic: u tin cc php gn gi tr lm cho nhiu mnh (hn)
ng
S dng cc phng php tm kim cc b: Simulated Annealing, WalkSAT
Tr tu nhn to

39

Bi ton suy din vs. Bi ton tha mn c

Bi ton suy din logic

Bi ton tha mn c (SAT)

Cn chng minh: biu thc logic (nh l) c bao hm bi

tp cc mnh KB
Ni cch khc: vi mi php din gii m trong KB ng, th
c ng?
C tn ti mt php gn gi tr ng/sai cho cc k hiu nh
(mt php din
gii) sao cho biu
thc l ng?

Gii php
KB

(KB )

nu
v ch nu:

l khng th tha mn c
(unsatisfiable)
(u
sat s ab e)

Tr tu nhn to

40

Lut suy din hp

p ggii (1)

Lut suy din hp gii (Resolution)

p q,
q q r
pr

Lut
suyy din hp
p g
gii p
p dng
g c
i vi cc biu
thc logic dng chun CNF

Lut suy din hp gii c tnh ng n (sound), nhng

kh c
khng
tnh
t h hon
h chnh
h h (incomplete)
(i
l t )

Tp gi thit (c s tri thc) KB cha biu thc (p q)

Cn chng minh: (p q) ?
Lut suy din hp gii khng th suy ra c biu thc cn
chng minh!

Tr tu nhn to

41

Lut suy din hp

p ggii (2)

Chuyn bi ton chng minh logic v bi ton SAT

Ph
Phng
php
h chng
h minh
i h bng
b phn
h chng
h

Vic chng minh s mu thun ca: (KB )

Tng ng vic chng minh s bao hm: KB

Lut suy din hp gii (Resolution rule)

Nu cc biu thc trong tp KB v biu thc (cn chng minh)

u dng CNF, th p dng lut suy din hp gii s xc nh
tnh (khng) tha mn c ca (KB )

Tr tu nhn to

42

Gii thut hp
p ggii

Chuyn i tt c cc biu thc trong KB v dng chun

CNF

p dng lin tip lut suy din hp gii (Resolution rule)

bt u t: ((KB ))

KB l kt hp ca cc biu thc dng chun CNF

Do , (KB ) cng l mt biu thc dng chun CNF!

Q trnh
Qu
t h p
dng
d
l t suy din
lut
di hp
h gii
ii dng
d li
l i khi:
khi

C mu thun xy ra
Sau khi hp gii, thu c (suy ra) biu thc rng (mu thun)
p, p
{}
Khng c biu thc mi no c sinh ra na
Tr tu nhn to

43

Chngg minh bngg hp

p ggii V d (1)

Gi s c tp gi thit KB
p q
p r
(q r) s

C chng minh nh l s
Cn

Bc 1. Chuyn i KB v dng chun CNF

(p r) c chuyn thnh (p
( p r)
((q r) s) c chuyn thnh (q r s)

Bc 2. Ph nh
biu thc cn chng
g minh
s

Bc 3. p dng lin tip lut hp gii i vi (KB ):

{ q, p r, q r s, s}}
{p,
Tr tu nhn to

44

Chngg minh bngg hp

p ggii V d (2)

Bt u qu trnh hp gii, ta c tp cc mnh :

1) p
2) q
3) p r
4)) q
q r s
5) s
Hp gii 1) v 3), ta thu c
6)) r
Hp gii 2) v 4), ta thu c
7) r s
Hp gii 6) v 7), ta thu c
8) s
Hp gii 8) v 5), ta thu c mu thun ({})

Tc l biu
bi thc ban u
(s) c
c chng minh l ng

Tr tu nhn to

45

Chngg minh bngg hp

p ggii V d (3)
p

p r

q r s

r
r s
s
{} (C mu thun)

Tr tu nhn to

46

Dngg chun Horn

Mt biu thc logic dng chun Horn nu:

Biu thc l mt lin kt V ca cc mnh

Mi mnh l mt lin kt HOC cc k hiu (literals), v c ti a l 1
(c th khng c!) k hiu khng nh (positive literal)
V d: (p q) (p r s)

Khng phi
Kh
hi mii biu
bi thc
th logic
l i nh
h u
c
th c

chuyn
h v

dng chun Horn!

Biu din tp gi thit KB dng chun Horn

Cc lut (Rules)
(p1 p2 pn q)
Tng ng vi lut: (p1 p2 pn q)
Cc s kin (Facts)
p1, q
Cc rng buc ton vn (Integrity constraints)
(
(p
p1 p
p2 pn)
Tng ng vi lut: (p1 p2 pn sai)
Tr tu nhn to

47

Lut suy din Modus Ponens tng qut

(p1 p2 pn q), p1, p2, , pn
q

Lut suy din Modus Ponens c tnh ng n (sound)

v
hon
h chnh
h h (complete),
(
l t ) i vi
i cc
k hiu
hi nh
h v

i vi tp cc biu thc KB dng chun Horn

Lut suy din

Modus Ponens c th
c s dng vi c
2 chin lc suy din (suy din tin v suy din li)

Tr tu nhn to

48

Suy din tin (forward chaining)

g

Vi mt tp cc mnh gi thit (c s tri thc) KB, cn suy ra

mnh kt lun Q
tng: Lp li 2 bc sau cho n
khi suy ra c kt
lun
p dng cc lut c mnh gi thit c tha mn trong KB
B sung
g kt lun
ca cc lut
vo KB

Tr tu nhn to

49

Suy din tin V d (1)

Tr tu nhn to

50

Suy din tin V d (2)

Tr tu nhn to

51

Suy din tin V d (3)

Tr tu nhn to

52

Suy din tin V d (4)

Tr tu nhn to

53

Suy din tin V d (5)

Tr tu nhn to

54

Suy din tin V d (6)

Tr tu nhn to

55

Suy din tin V d (7)

Tr tu nhn to

56

Suy din li (backward chaining)

g

tng: Qu trnh suy din bt u t mnh kt lun Q

chng minh Q bng

tp mnh
(c s tri thc) KB

Trnh cc vng lp

Kim tra xem Q c chng minh (trong KB) cha,

Nu cha, tip tc chng minh tt c cc mnh gi thit ca
mt lut no (trong KB) c mnh
kt
lun l Q
Kim tra xem cc mnh mi c trong danh sch cc mnh
cn chng minh cha? Nu ri, thi khng b sung (li) na!

Trnh vic chng minh lp li i vi 1 mnh

c chng minh (trc ) l ng

c chng minh (trc ) l khng th tha mn c (sai)
trong KB
Tr tu nhn to

57

Suy din li V d (1)

Tr tu nhn to

58

Suy din li V d (2)

Tr tu nhn to

59

Suy din li V d (3)

Tr tu nhn to

60

Suy din li V d (4)

Tr tu nhn to

61

Suy din li V d (5)

Tr tu nhn to

62

Suy din tin hay Suy din li?

Suy din tin l qu trnh da trn d liu (data-driven)

V d:
d vic
i nhn
h dng
d
i tng,
t
vic
i a

ra quyt
t nh
h

Suy din tin c th thc hin nhiu bc suy din d

tha chng lin quan ti (cn thit cho) mc tiu cn
chng minh

Suy din li l qu trnh hng ti mc tiu (goal-driven),

(goal driven)
ph hp cho vic gii quyt vn

V d: Lm sao ginh c hc bng ca 1 chng trnh

PhD?

Tr tu nhn to

63

Logic
g nh - u v nhc im

(+) Logic nh cho php d dng pht biu (biu din) c s tri
thc bng tp cc mnh

(+) Logic nh cho php lm vic vi cc thng tin dng ph

nh, dng tuyn (disjunctive)

(+) Logic nh c tnh cu to (kt cu)

(+) Ng ngha trong logic nh khng ph thuc ng cnh

(context independent)
(context-independent)

Ng ngha ca mnh (S1 S2) c suy ra t ng ngha ca S1 v

ng ngha ca S2

Khng nh trong ngn ng t nhin (ng ngha ph thuc vo ng cnh

ca cc cu ni)

((-)) Kh nng din t (biu din) ca logic nh l rt hn ch

Logic nh khng th din t c (nh trong ngn ng t nhin):

Nu X l cha ca Y, th Y l con ca X
Logic nh phi lit k (xt) mi kh nng gn gi tr chn l
(ng/sai) cho X v Y
Tr tu nhn to

64

Gii hn ca Logic
g nh

Hy xt v d sau y:

T l mt
Tun
t sinh
i h vin
i ca
HUT

Mi sinh vin ca HUT u hc mn i s

V Tun l mt sinh vin ca HUT,

HUT nn Tun hc mn i s

Trong logic nh :

nh p: Tun
Tun l mt sinh vin ca HUT
HUT

nh q: Mi sinh vin ca HUT u hc mn i s

nh
r: Tun hc
mn i
s

Nhng: (trong logic nh ) r khng th suy ra c t p v q!

Tr tu nhn to

65

Logic
g v t (FOL) V d

V d nu trn c th c biu din trong logic v t bi cc

biu thc (logic v t) sau

HUT_Student(Tuan): Tun l mt sinh vin ca HUT

x:HUT_Student(x) Studies_Algebra(x): Mi sinh vin
ca HUT u hc mn i s
Studies_Algebra(Tuan): Tun hc mn i s

Trong logic v t, chng ta c th chng minh c:

{HUT Student(Tuan) x:HUT_Student(x)
{HUT_Student(Tuan),
x:HUT Student(x)
Studies_Algebra(x)}

Studies_Algebra(Tuan)

Vi v d trn, trong logic v t:

Cc k hiu Tuan, x c gi l cc phn

t (Tuan l hng,

x l bin)

Cc k hiu HUT_Student v Studies_Algebra l cc v t

K hiu l lng t vi mi
Cc phn
t,
cc v t v cc lng t cho php biu
din
cc biu
thc
Tr tu nhn to

66

FOL Ngn
g ng
g (1)

4 kiu k hiu (symbols)

Hng (Constants): Cc tn ca cc i tng trong mt lnh vc

bi ton c th (v d: Tuan)
Bin (Variables): Cc k hiu m gi tr thay i i vi cc i
tng khc nhau (v d: x)
K hiu hm (Function symbols): Cc k hiu biu din nh x
(quan h hm) t cc i tng ca min (domain) ny sang cc
i tng ca min khc (v d: plus)
Cc v t (Predicates): Cc quan h m gi tr logic l ng hoc
sai (v d: HUT_Student and Studies_Algebra)

Mi k hi
hiu hm
h h
hoc
v t u
c
mt
t tp
t cc
th
tham s

V d: HUT_Student v Studies_Algebra l cc v t c 1 tham s

V d: plus l mt k hiu hm c 2 tham s
Tr tu nhn to

67

FOL Ngn
g ng
g (2)

Mt phn t (term) c nh ngha (truy hi) nh sau

Mt hng s l mt phn t
Mt bin l mt phn t
Nu t1, t2,,tn l cc thnh phn v f l mt k hiu hm c n
tham s
s, th f(t1,tt2,,ttn) l mt phn t
Khng cn g khc l mt phn t

Cc v d ca phn t (term)

Tuan
2
f i d(T
friend(Tuan)
)
friend(x)
plus(x,2)
Tr tu nhn to

68

FOL Language (3)

Cc nguyn t (Atoms)

Cc biu thc (Formulas) c nh ngha nh sau

Nu t1,tt2,,ttn l cc thnh phn (terms) v p l mt v t c n

tham s, th P(t1,t2,,tn) l mt nguyn t (atom)
V d: HUT_Studies(Tuan), HUT_Studies(x),
g
(
), Studies(x)
( )
Studies_Algebra(Tuan),

Mt nguyn t (atom) l mt biu thc

Nu v l cc biu thc, th v l cc biu thc
Nu l mt biu thc v x l mt bin, th x: l mt biu
thc
Khng cn g khc l mt biu thc

Lu : x: c
nh
ngha
g
bng
g x:

Tr tu nhn to

69

FOL Ng
g ngha
g (1)

Mt php din gii (interpretation) ca mt biu thc

c biu din bng cp <D
<D,I>
I>
Min gi tr (Domain) D l mt tp khc rng
Hm di
H
din gii
ii (Interpretation
(I t
t ti
function)
f
ti ) I l mt
t php
h
gn gi tr i vi mi hng, k hiu hm, v k hiu v t
sao cho:

i vi hng c: I(c) D

i vi k hiu hm (c n tham s) f: I(f): Dn D

i vi
i k hi
hiu v t (c
( n tham
th
s)
) P: I(P):
I( ) Dn {true,
{
false}}

Tr tu nhn to

70

FOL Ng
g ngha
g (2)

Din gii i vi mt biu thc logic v t. Gi s ,

v l cc biu thc v t

Nu l , th I()=sai nu I()=ng, v
I()=ng nu I()=sai
Nu l (), th I()=sai nu I() hoc I() l
sai, v I()=true nu c I() v I() l ng
Gi s
x:(x)
( ) l mt
t biu
bi thc,
th th
I(x:(x))=ng nu I()(d)=ng vi mi gi tr
dD

Tr tu nhn to

71

FOL Ng
g ngha
g (3)

Mt biu thc l tha mn c (satisfiable) nu v

ch nu tn ti mt php din gii <D
<D, I> sao cho I()
Chng ta k hiu l: I
Nu I , th chng ta ni rng I l mt m hnh
( d l) ca
(model)
. Ni cch
h kh
khc, I tha
th mn
((satisfies)
ti fi )
Mt biu thc l khng th tha mn c
(unsatisfiable) nu v ch nu khng tn ti bt k php
din gii no
Mt biu thc l ng (valid) nu v ch nu mi php
di gii
din
ii I u
tha
th mn
Chng
Ch tta k hi
hiu l:
l

Tr tu nhn to

72

Lngg t logic
g Vi mi

C php ca lng t logic Vi mi (universal

quantifier):
q
) <Bin1,,,Bin
,
>
n>: <Mnh

V d: Tt c (mi) sinh vin ang ngi hc trong lp K4

u chm ch
Ngoi_trong_lop(x,K4)
x:
N i t
l ( K4) Cham_chi(x)
Ch
hi( )

Mnh (x: P) l ng trong mt m hnh m, khi v ch

khi P ng vi x l mi (mi) i tng trong m hnh

Tc l, mnh (x: P) tng ng vi s kt hp

(v) ca tt c cc trng hp ca P

Ngoi_trong_lop(Hue,K4)
N
i t
l (H K4) Cham_chi(Hue)
Ch
hi(H )
Ngoi_trong_lop(Cuong,K4) Cham_chi(Cuong)
Ngoi_trong_lop(Tuan,K4) Cham_chi(Tuan)

Tr tu nhn to

73

Lngg t logic
g Tn ti

C php ca lng t logic Tn ti (existential

quantifier):
q
) <Bin1,,,Bin
,
>
n>: <Mnh

V d: Tn ti (c) sinh vin ang ngi hc trong lp K4,

v l sinh vin chm ch:
Ngoi_trong_lop(x,K4)
x:
N i t
l ( K4) Cham_chi(x)
Ch
hi( )

Mnh (x: P) l ng trong mt m hnh m, khi v ch

khi P l ng vi x l mt i tng trong m hnh

Tc l, mnh (x: P) tng ng vi php tuyn

(hoc) ca cc trng hp ca P

Ngoi_trong_lop(Hue,K4)
N
i t
l (H K4) Cham_chi(Hue)
Ch
hi(H )
Ngoi_trong_lop(Cuong,K4) Cham_chi(Cuong)
Ngoi_trong_lop(Tuan,K4) Cham_chi(Tuan)

Tr tu nhn to

74

Cc c im ca cc lngg t logic
g

Tnh hon v:

(x y) l tng ng vi (y x)

(x y) l tng ng vi (y x)

Tuyy nhin, ((x y)

y) khng
g tng
g ng
g vi ((yy x))

x y: Yeu(x,y) - Trn th gii ny, tn ti (c) mt ngi m

ngi yu qu tt c mi ngi khc

y x: Yeu(x,y) - Trn
Trn th gii ny, mi ngi u c t nht
mt ngi khc yu thch

Mi lng t logic ( hoc ) u c th c biu din

bng lng t kia

(x: Thich(x,Kem)) l tng ng vi (x: Thich(x,Kem))

(x: Thich(x,BongDa)) l tng ng vi (x:
Thich(x,BongDa))
Thi h( B
D ))
Tr tu nhn to

75

S dngg logic
g v t
Biu din cc pht biu trong ngn ng t
nhin
hi

x l anh/ch/em ca y tng ng vi x v y l anh

em rut
rut
x,y: Anh_chi_em(x,y) Anh_em_ruot(x,y)

M ca c l m tng ng vi m l ph n v m l
bc cha m ca c
m,c:
, Me(c)
( ) = m ((Phu_nu(m)
( ) Cha_me(m,c))
( , ))

Quan h anh em rut c tnh cht i xng

x y: Anh_em_ruot(x,y)
x,y:
Anh em ruot(x y) Anh_em_ruot(y,x)
Anh em ruot(y x)
Tr tu nhn to

76

Xy dngg c s tri thc vi logic

g v t
1.

Xc nh lnh vc bi ton (cn xy dng c s tri thc)

2.

T hp,
Tp
h
th thp
thu
th cc
ttrii th
thc li
lin quan

3.

Xc nh tp hp (t vng) ca: cc v t (quan h), cc

hm v cc hng s
hm,

4.

M ha (biu din) cc tri thc tng qut v lnh vc bi

ton

5.

M ha (biu din) cc m t ca cc v d (trng hp)

c th

6.

Kim tra
Ki
t th tc
t suy di
din: t cc
cu
hi (t
(truy vn)
) v

kim tra cc cu tr li nhn li

7.

Kim tra v sa li trong c s tri thc

Tr tu nhn to

77