Logic in Computer Science

CHNG 3. THAO TC TRN CNG BOOL

CHNG 3.
THAO TC TRN CNG BOOL
3.4. Chuyn i cng thc mnh thnh CNF (conjunctive Normal Form - Dng
Chun Hi)
V d
Cho mch hnh 3.4.
B sung mnh E
(AB) E
((AB)) E) (E (AB))
((AB)) E) (E (AB))
(AB E) (E A)(EB)
(AB E) (E A)(EB)
D
A

C
Hnh 3.4-1 B sung cc k hiu mi E

T hnh 3.4-1 Chng ta b sung mnh F, c hnh 3.4-2. V khi

Le Huy Thap

42

Logic in Computer Science

CHNG 3. THAO TC TRN CNG BOOL

D
A

B
F

Hnh 3.4-2. B sung cc k hiu mi E , F

(AB) E
((AB)) E) (E (AB))
((AB)) E) (E (AB))
(AB E) (E A)(EB)
(CF)(FC)
T hnh 3.4-2. Chng ta b sung mnh G, c hnh 3.4-3. V khi
(AB) E
((AB)) E) (E (AB))
((AB)) E) (E (AB))
(AB E) (E A)(EB)
(CF)(FC)
(DEG)(GD)(GE)
T hnh 3.4-3 Chng ta b sung mnh H c hnh 3.4-4. V khi
D
A

B
F
C
Hnh 3.4-3. B sung cc k hiu mi E , F ,G
(AB) E
Le Huy Thap

43

Logic in Computer Science

CHNG 3. THAO TC TRN CNG BOOL

((AB)) E) (E (AB))
((AB)) E) (E (AB))
(AB E) (E A)(EB)
(CF)(FC)
(DEG)(GD)(GE)
(EFH) (HE) (GF))
T hnh 3.4-3 Chng ta b sung mnh H c hnh 3.4-4. V khi
D

G
I

B
F

Hnh 3.4-4. B sung cc k hiu mi E , F , G , H

(AB) E
((AB)) E) (E (AB))
((AB)) E) (E (AB))
(AB E) (E A)(EB)
(CF)(FC)
(DEG)(GD)(GE)
(EFH) (HE) (HF))
T hnh 3.4-4 Chng ta b sung mnh I c hnh 3.4-5. V khi

Le Huy Thap

44

Logic in Computer Science

CHNG 3. THAO TC TRN CNG BOOL

G
I

B
F

Hnh 3.4-5. B sung cc k hiu mi E , F , G , H, I

(A B) E
((A B)) E) (E (A B))
((A B)) E) (E (A B))
(A B E) (E A) (E B)
(C F) (F C)
(D E G) (G D) (G E)
(E F H) (H E) (H F))
(G H I) (I G) (I H))
(I)
3.5. Biu din CNF
T
(A B E) (E A) (E B)
(C F) (F C)
(D E G) (G D) (G E)
(E F H) (H E) (H F))
(G H I) (I G) (I H))
(I)
Nhn c trn, chng ta c th vit li nh sau:
(A + B + E)( E + A) (E + B)
(C + F)(F + C)
(D + E + G)(G + D)(G + E)
(E + F + H)(H + E)(G + F))
( G + H + I (I + G) (I + H)
Le Huy Thap

45

Logic in Computer Science

CHNG 3. THAO TC TRN CNG BOOL

(I)
3.14. Cy quyt nh nh phn
V d cy 3.14-1

var(v)

var(v)=0

var(v)=1

low(v)

high(v)
var(v){0,1}}

var(v){0,1}}

Hnh 3.14-1. Cy quyt nh v cc nh ca n

Mt cy quyt nh nh phn T xc nh mt hm Bool fv , vi mi nh v thuc cy,

c xc nh nh sau:
Nu v l nh cui, th
- Nu value(v) =1, th fv = 1
- Nu value(v) =0, th fv = 0
Nu v khng phi l nh cui v var(v) = xi, th,
fv (x1,....., xn ) = xi . flow(v) (x1,....., xn ) + xi . fhigh(v) (x1,....., xn )
Hm Bool nh ngha bi cy T l froot(T), trong root(T) k hiu gc ca cy T.
V d
Cy quyt nh nh phn vi b so snh 2 bit c cho bi cng thc:
f(x1, x2, x3 , x4) = (x1 x3) (x2 x4) c ch ra hnh 3.14-2 di y ( nhnh tri
l low, nhnh phi l high)
x1

x3

x2

0
1

x4

1
0

0
0

x4

x4

1
1

Le Huy Thap
Hnh 3.14-2. Cy

x2

x4

x2

x4

x3

x4

x2

x4

1
0
0
0
0
0
0
0
0

hm f(x , x46
quyt nh
, x3 , x4) = (x1 x3) (x2x4)
1
2

x4

0
0

1
1

Logic in Computer Science

CHNG 3. THAO TC TRN CNG BOOL

tm gi tr ca hm tng ng vi cy gn chn tr, i theo cy t gc n l theo

quy tc:
- If var(v) c gn l 0, hy i theo low(v)
- If var(v) c gn l 1, hy i theo high(v)
Gi tr gn nh cui (l) l gi tr ca hm. Chng hn, f(1, 0, 1, 0) = 1
3.15. Biu din ngn gn hn (more concise representation)

x1

x3

x2

x4

1
0

x4

1
1

x3

x4

x2

x4

0
0

Hnh3.15-1.

x2

x2

x4

x4

x4

x4

1
1

Cc cy con c th gp li

V d, sau khi gp cc cy con ng cu, cy v d trn c hnh (3.15-2)

0

x3

x3

x1

x2

x2

1
0

x4

x4

1
1

x4
0

Hnh 3.10. Cy rt gn

3.16. S quyt nh nh phn c sp xp (Ordered Binary Decision Diagrams)

Le Huy Thap

47

Logic in Computer Science

CHNG 3. THAO TC TRN CNG BOOL

S quyt nh nh phn c sp xp (OBDD) c tnh cht b sung l, vi mt th t

no < ca cc bin x1, x2,...,xn, var(v) < var(low(v)) v var(v) < var(high(v)) cho mi
nh v.
Bryant t tn l cc hm th.
V d, (vi s nghin cu trn) th x1 < x3 < x2 < x4. ta c hnh 3.16
0

x1

x3

x3
1

x2

x2

1
0

0
1

x4

x4

x4

Hnh 3.16. Cy c sp xp

3.17. S quyt nh nh phn c sp xp v rt gn ROBDDs (Reduced

V d ROBDD cho v d ang nghin cu.
By gi khi chng ta ni n BDDs cng c ngha l ROBDDs.
Ch rng ln ca BDD ph thuc rt nhiu vo cch sp xp bin.
Bi ton sp xp bin, nhn chung vic tm cch sp xp bin ti u l bi ton NP
y .

Le Huy Thap

48