Requirements Midterm Exam
                    Graduate AI (Fall 1999)

The exam is open-books you can bring everything including calculators,
and your favorite bird...

Relevant material of the Russel textbook:

Chapter 3 (with the exception of 3.7)
Chapter 4 (with the exception of 4.3)
Sections 5.1, 5.2, 5.3, and 5.4
Sections 6.3, 6.4
Sections 7.1, 7.2, 7,3
Sections 9.1, 9.2, 9.3
Sections 10.1, 10.2, 10.3, 10.4, 10.8
Sections 11.1, 11.2
Sections 14.1, 14.2, 14.4

Material that was discussed in class that is relevant
for the midterm exam (but not necessarily is discussed in
the textbook):
a) Backtracking algorithm
b) Representing natural language statements using first order logic
c) Converting first order logic to clause form
d) Doing Resolution proofs
e) How PROLOG uses resolution
f) Theoretical Problems involving resolution
g) Non-monotonic reasoning (only bird's perspective)
h) resolution for propositional calculus

In general, the midterm exam will focus on the following 
topics: formulating search problems, finding heuristics
for search problems, "general" search algorithm, breadth first
search, uniform cost search, depth-first seach, best-first search,
A*, hill climbing, simulated annealing, resolution for propositional
calculus, resolution for first order predicate calculus, expressing
natural language using first order predicate logic, properties of
resolution, unification algorithm, resolution and PROLOG, planning
(only bird's perspective), uncertainty (only "very basic things", 
and Bayes' theorem). There will be a significantly
high number of "logical reasoning problems" in the midterm
exam.