Final

• Thursday, December 13th from 4:00 p.m. - 5:50 p.m.
• EPS 108
• You may bring a calculator and three sheets of 8.5 by 11 notes.

Format

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

Topics: Search, Knowledge Representation, Learning

• Common Lisp/CLOS
• Prolog
• 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*
• 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: Perceptrons, Ant Colony Optimization
• Philosophy: Weak AI, Strong AI, Gardner's Theory of Multiple Intelligences, etc.

Finals Week Office Hours

• Tuesday 2:30 p.m. - 4:30 p.m.