AI: Problem Set 3

Assigned: Feb. 19
Due: March 2

Problem 1

Let D be the domain of solid objects. Let L be the first-order language over D with the following non-logical symbols:
inside(O1,O2) --- Object O is inside O2.
empty(O) --- Object O is empty.
accessible(O) --- Object O is accessible.
red(O) --- Object O is red.
Represent the following statements in L.

Problem 2

Convert sentences A through E above, and the negations of sentences F and G to clausal form (CNF).

Problem 3

Give resolution proofs of F and G from A-E. (No credit will be given for a proof that is not a resolution proof.)