Scribd
Upload
39 views5 pages

Asst

This document contains examples and exercises on directed graphs, propositional logic, first-order logic, and Boolean algebras. It asks the student to fill in tables, draw graphs, determine ground clauses, perform resolution theorem proving, write axioms, and convert an equational argument to clauses. The student must apply concepts like unification, Herbrand universes, and Boolean replacements to complete the tasks.

Uploaded by

nilima
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
39 views5 pages

Asst

This document contains examples and exercises on directed graphs, propositional logic, first-order logic, and Boolean algebras. It asks the student to fill in tables, draw graphs, determine ground clauses, perform resolution theorem proving, write axioms, and convert an equational argument to clauses. The student must apply concepts like unification, Herbrand universes, and Boolean replacements to complete the tasks.

Uploaded by

nilima
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Assignment 8

Structures
Fill in the table for the following directed graph:

a
b

d e

a
b
c
d
e
f

d
Draw the directed graph for the following table:

a
a
b
c
d
e
f

a
1
0
0
0
0
0

b
1
1
0
0
0
0

c
0
1
1
0
0
0

d
0
0
1
1
0
0

e
0
0
0
1
1
0

f
0
0
0
0
1
1

e
d

Suppose that a first-order languge has only a constant symbol 0, a unary function symbol
f , and a binary relation symbol r.
Then the third level S3 of the Herbrand universe {0, f 0, f f 0, f f f 0}.
Determine the number of distinct ground clauses that one can make from the transitivity clause { rxy, ryz, rxz} using S3 .
Answer:

Clauses
Let S be the structure on {0, 1, 2} with a unary operation defined by x0 = 2x + 1 (mod
3), and let a b mean that a and b have the same parity. Given the literals
L1 = (x0 y)

L2 = x y 0

determine all pairs (a, b) that satisfy the clause C = {L1 , L2 } in S by filling in the following:

x
0
0
0
1
1
1
2
2
2

y x0 y 0 x0 y (x0 y) x y 0 C
0
1
2
0
1
2
0
1
2
Does S satisfy the clause C?

Opp-unification
Suppose our first-order language has a binary relation symbol r and a binary operation
symbol g. Show that the two clauses {rggxyzguv, rguzgugxy} and { rgxygyz} are oppunifiable, and find the most general opp-unifier (1 , 2 ).

x
y

Thus 1 = z

u
v

and

x
2 = y
z

Resolution Theorem Proving


For f, g unary function symbols and r a binary relation symbol fill in the reasons for the
following resolution derivation:

1. {rf gxx}

given

2. { rf f gg0}

given

3. { rxy, ryz, rxz}

given

4. { rxy, rf yf y}

given

5. {rf f gxf x}
6. { rf f gg0y, ry0}
7. { rf g00}
8. { }
The following uses ground clauses from the given clauses of the previous problem. Identify
the source of each ground clause (e.g., clause 3) that is an instance of one of the above given
clauses, or otherwise justify the resolution step:

1. {rf g00}
2. {rf gg0g0}
3. { rf f gg0}
4. { rf f gg0f g0, rf g00, rf f gg00}
5. { rf gg0g0, rf f gg0f g0}
6. { rf f gg0f g0, rf g00}
7. {rf f gg0f g0}
8. { rf g00}
9. { }

For the language {, ,0 , 0, 1} of Boolean algebras write down the clauses AX .

1.

Reflexive

2.

Symmetric

3.

Transitive

4.

Replacement for

5.

Replacement for

6.

Replacement for

Convert the following equational argument into a set of clauses such that the argument
is valid iff the set of clauses is not satisfiable.
xy uv

xy yx

And justify the derivation of the empty clause.

1.

Reflexive

2.

Symmetric

3.

Transitive

4.

Replacement for

5.

from the premiss

6.

from the conclusion

7.

{}

You might also like