CSE560 Final Topics

You will be responsible for all of the topics on the midterm list, but the final will be weighted towards the topics covered after the midterm.

Chapter 6

Just the part on delaying goals.
What types of goals would we want to delay?
This also ties in with inquality reasoning and negation as failure in Chapter 7.

Chapter 7

For equality, what are the two ways it can be done (axioms versus paramodulation).
What are the pros and cons of the two ways.

For inequality, what are the two ways of doing it (axioms versus UNA).
Pros and cons of each.
How can UNA be implemented?

For CKA, what are the two ways of doing it (clark's completion versus negation as failure).
Are they exactly alike?
Consider the kb with the single rule a <- ~b
Can you prove a using negation by failure?
What is its clark completion?

When clauses are in disjunctive normal form, what restriction of the number of positive and/or negative literals gives you clauses that can be written in datalog?

What is the restriction for horne clauses?

How did we change our reasoning algorithms to work with arbitrary clauses in disjunctive normal form?

What is special about unit resolution?

How did we allow arbitrary quantifiers?

Chapter 8

Strips actions versus situation calculus for specifying actions.
How do they differ?

In what way is situation calculus better than strips, and vice versa.

For situation calculus, the actions are specified in the logic. Why is this better than what Strips does?
The partial order planner used the Strips actions. Could we have done this with the situation semantic formalism?

How does forward planning work?

How does partial order planning work?

Chapter 9

What are the components of an assumption-based architecture? What is a scenario, explanation, extension?

What is abduction? How does it use the components of the assumption-based architecture? Be able to find an explanation for some observation.

What is default reasoning? How does it use the components of the assumption-based architecture? Be able to find a proof from some query.