Final

Time: Friday, December 17th from 8:00 a.m. - 9:50 a.m.

Location: EPS 108

What to Bring

• A calculator
• Three sheets of 8.5 by 11 notes

Format

• There will be between 6 and 8 questions
• One question will require Common Lisp/CLOS
• One question will require Prolog
• One question will relate to one of the programming assignments.

Topics: Search, Knowledge Representation, Learning

• Common Lisp/CLOS
• Agents: PEAS, environmental characteristics, types of agents
• Uninformed Search: Breadth-First, Depth-First, Iterative Deepening, Bidirectional, Uniform Cost, Depth-Limited
• Informed Search: Hill Climbing, Beam Search, Greedy Best First, A*, IDA*, Simulated Annealing
• Adversarial Search: Minimax, Alpha-Beta, ExpectiMinimax
• Constraint Satisfaction
• Propositional Calculus: translating sentences from English into propositional calculus and vice-versa, putting statements into conjunctive normal form, resolution theorem proving
• First Order Predicate Calculus: translating sentences from English into first order predicate calculus and vice-versa, Horn clauses, knowledge engineering
• Learning Techniques: Genetic Algorithms, Perceptrons
• Philosophy: Weak AI, Strong AI, Ethics, etc.

Finals Week Office Hours

• Neal: Wednesday 3:00 p.m. - 4:30 p.m. near whiteboard at end of CS hallway
• John: Thursday 3:00 p.m. - 5:00 p.m.

Course Evaluation

Please go to this web site and evaluate the course. Your constructive criticisms are appreciated and will be used to improve the course in the future.