Instructor: Joseph
O'Rourke
Required Textbook:
Artificial Intelligence: A Modern Approach.
Stuart Russell, Peter Norvig.
ISBN: 0131038052.
($73 at amazon.com; $?? at our
bookstore.)
This book is 932 pages, much much more than we can cover in the
semester. And it is more advanced than we need; it is used in
many graduate courses. But it is by far the best book available
(I examined about ten),
and I think it is better to get an expensive good book than to
get a weak but less expensive one.
The book has a useful
Web page.
Recommended Textbook:
ANSI Common Lisp.
Paul Graham.
Prentice Hall. 1996.
ISBN: 0133708756.
($47 at amazon.com; $?? at our
bookstore.)
You do not have to purchase this. I will have two copies available,
one in McC104 and one in McC209. And I will teach LISP under the
assumption that you have no book. But among those available, this
is one of the best.
There are also
online resources.
Time: MWF 10-10:50.
Location: Burton 209
Prerequisites: Computer Science II (CSC 112).
NB: This is a change from the past two offerings, when the
course had no prerequisites.
Although I will not explicitly use C or C++ in class,
I will assume you are proficient programmers in those languages
while teaching LISP.
Programming Language: LISP (no prior exposure assumed).
Course Structure: We meet three times a week; there is no
lab.
There will be one assignment per week, due each Monday morning
at 10:00AM.
There will be one reading quiz per week, taken self-scheduled
on the Web
by Monday at 10:00AM.
There will be a project starting Thanksgiving and due the last
day of classes. No midterm or final exam.
Grading:
10 Assignments |
|
10 Reading Quizzes |
|
Project |
|
O'Rourke Office Hours & Schedule
Anonymous feedback to Joe on any subject.
Week | Dates | Topics | Chaps | Assign | Reading Quiz |
1 | 8-10 Sep | History
Turing Test Loebner Prize FRED LISP; clisp count.lsp |
1 |
A1
A1 solutions |
Q1
Q1 answers |
2 | 13-17 Sep | Agents; Search
LISP: lists D.lsp pig.lsp |
2 | A2
A2 solutions |
Q2
Q2 answers |
3 | 20-24 Sep | Search
LISP shortest.lsp queens.lsp |
3 | A3
A3 solutions |
Q3
Q3 answers |
4 | 27-1 Oct | Uniformed Search
Pushing Blocks push.lsp LISP arrays A* Algorithm n-puzzle Games: minimax Java Games |
4.1-4.2 | A4
A4 solution |
Q4
Q4 answers |
5 | 4-8 Oct | Games: alpha-beta
alphabeta.lsp Analysis of alpha-beta Heuristics |
5 | A5
A5 report |
Q5
Q5 answers |
6 | 13-15 Oct |
History: Chess, Checkers, Go, Backgammon
Knowledge Rep Propositional Logic |
6 |
(A5 due)
A6 |
Q6
Q6 answers |
7 | 18-22 Oct |
babies.lsp
1st Order Logic Brothers and sisters I have none. Proofs in FOPL Resolution (begin) Unification |
7 |
(A6 due)
A7 A7 Solution |
Q7
Q7 answers |
8 | 25-29 Oct |
Resolution (continued)
Consistency, Completeness, Godel's Theorem Cyc FAQ Cycorp Learning Decision Trees |
9 |
(A7 due)
A8 A8 Solution |
(no quiz) |
9 | 1-5 Nov | Learning Blackjack
Bongard Problems Current Best Hypothesis Alg. Version Spaces |
18 |
(A8 due)
A9 |
Q8
Q8 answers |
10 | 8-12 Nov | Learning
Version Spaces (continued) PAC Learning Genetic Programming genetic-programming.org Symbolic Regression GenBebop |
18 |
(A9 due)
A10 |
Q9
Q9 answers |
11 | 15-19 Nov |
Genetic Algorithms
Biomorphs GA Maze solver Project discussion (1) |
19 | (A10 due) |
Read Chap.19 through 19.5: pp.563-587.
Take Q10 |
12 | 22 Nov |
subs.lsp
Project discussion (2) |
20 | Project | |
13 | 29-3 Dec |
Neural Nets
Perceptrons Perceptron Convergence Theorem Perceptron Applet Backpropagation Das Applet Handwriting applet Various applets |
25 | ||
14 | 6-10 Dec |
Robotics
Shortest paths Project discussion Behavior-based robotics Subsumption architecture Robots video |
25 | (Mon 6 Dec: Q10 & Project I) | Q10 answers |
15 | 13 Dec | Consciousness | 26 | Project II: 14 Dec | Evaluation |
21 Dec | Project III: 21 Dec |