Computer Science 431
Exam #3 review:
Disclaimer: I have attempted to be comprehensive in the following,
but important items may have been omitted by mistake. If you see such
an omission, please let me know, but you are responsible for all of
the lecture material to date.
Please note that a final exercise set appears at the end of
this review. The exercise set will be due next Monday, but I would
like to be able to answer questions about it this coming
Thursday.
The third hour exam will be on Friday, Dec. 1, and will cover
Textbook: Chapters 9 and 11
Notes: Notes on expert systems in general and CLIPS in
particular
- Be able to do basic unification, Skolemization, and resolution
theorem proving in the predicate calculus. A short exercise
follows in this file.
- Be able to write basic Prolog programs (to the extent done in
homework exercises).
- Be able to describe states and actions in the situation
calculus (please note - added after Monday's lecture).
- Be able to describe and to use the POP (Partial Order
Planner) algorithm in a simple case.
- Be able to describe the architecture of an expert system, and
to write templates and rules for CLIPS.
- Be able to describe the use of confidence factors, fuzzy
variables, and fuzzy logic in fuzzy clips. You will not be asked
to actually write fuzzy productions or facts (but perhaps to
explain a sample).
Any questions? Please ask!
-Bob
Final Exercise Set
Due Monday, Dec. 4 (in class)_
These problems are intended primarily for your review for Friday's
exam, and so should be completed as much as possible before
Thursday's class so that we can talk about them.
- Please work problem 11.4 on page 365
- Please use resolution theorem proving to demonstrate the
following (from Hodges, page 209):
- Trumpeter bullfinches can sing two notes at once.
- Trumpeter bullfinches are birds.
- There are some trumpeter bullfinches.
- Therefore, there are some birds that can sing two notes at
once.