STS 350
Exam #2 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.
The second hour exam will be held on Friday, March 17. It will
cover
- Papers: Newell and Simon
- Textbook: Chapters 3 - 5
- Notes on search and knowledge representation (old powerpoint slides
would be useful for a review).
This will be an examination mostly on symbolic AI and the physical symbol system
hypothesis.
- Search
- Be able to define terms such as
- states (including start/initial and
final states)
- operators (and preconditions and post-conditions)
- heuristics
(and be able to give an example)
- means-ends analysis (in class Monday or Wednesday)
- productions
- Be able to describe and illustrate depth-first and breadth-first search
and heuristic search
- Knowledge Representation
- Be able to discuss records, frames (as, for example, in CLIPS) , scripts,
ISA and semantic networks, logic,
and rules/productions as knowledge representation schemes
- Expert Systems: Architecture of an expert system Simple templates,
facts and rules (define and say what they mean)
- PSSH
(briefly)
- Be able to say what a physical symbol system is
- Be able to say what the physical symbol system hypothesis is and what
'sufficient' and 'necessary' mean in the context of the PSSH.
There may be more, but I think that's it. If you have any questions,
please ask.