CSE 4308/5360 - Exams - Preparation for Second Midterm

Material

The material covered in this midterm consists of the following chapters and sections in the textbook:

Chapter 7, sections 7.1, 7.2, 7.3, 7.4, 7.5 up to and NOT INCLUDING the "forward and backward chaining" subsection, which starts on page 217.
Chapter 8, sections 8.1, 8.2, 8.3.
Chapter 9, sections 9.1, 9.2, 9.3.
Chapter 11, sections 11.1, 11.2, 11.3.
Chapter 12, sections 12.3, 12.4, 12.5.

Practice Questions

Convert the following knowledge base to conjunctive normal form:
```
A AND B
B => (A OR C)
```
Consider the following knowledge base:
```
A
B
NOT A
```
Does this knowledge base entail the following sentence:
```
B OR C
```
Justify your answer.
Textbook exercise 7.5.
(harder) Textbook exercise 7.6.a
Textbook exercise 7.8.

For some sentence S involving literals A, B, C, here is the truth table:

A	B	C	Sentence
false	false	false	true
false	false	true	false
false	true	false	false
false	true	true	true
true	false	false	false
true	false	true	false
true	true	false	false
true	true	true	true

Give a conjunctive normal form for sentence S.

What is the negation of each of the following sentences?
```
1. for-every x, exists y: son(x) = y
2. for-every x, for-every y: son(x) = y <=> father(y) = x
```
In your answers, any "not" may only appear after the last appearance of a universal or existential quantifier.
Textbook exercise 8.8.

Consider the technique of propositionalization. For each of the following two knowledge bases, decide if propositionalization can be applied successfully. If not, why not?

KB 1:

for-every x: king(x) and greedy(x) => evil(x)
king(John)
greedy(John)
brother(Richard, John)


KB 2:
for-every x: king(x) and greedy(x) => evil(x)
king(John)
greedy(John)
brother(Richard, John)
king(father(John))

What is the most general unifier for each of the following pairs of expressions:

1. major(John, x), major(y, mathematics)
2. major(John, x), major(y, z)
3. major(John, x), major(y, x)
4. major(John, x), major(x, y)

Textbook exercise 9.3, parts (a), (b)
Textbook exercise 9.4.
Textbook exercise 9.19, parts (a), (b), (c).
Textbook exercise 11.2.
Textbook figure 11.4 provides a description for a deterministic version of the blocks world. We want to make a modification to that description, so as to model a nondeterministic version, in which the effect of action move(b, x, y) is sometimes on(b, y) and sometimes on(b, table). How would you modify the description of the move action to make it reflect the above two possible outcomes of move(b, x, y)?
In the nondeterministic blocks world described in the previous exercise, suppose that the initial state and the goal are as described in figure 11.4. Is there a finite conditional plan that achieves this goal with guaranteed success? If yes, list the sequence of actions in that plan. If no, explain why not.