Introduction to Artificial Intelligence

Professor Ernest Davis
(Note: This web page was restored, as best I could, in Fall 2010.)

Reaching Me

Class mailing list

You should subscribe to the class email list at this link.

Prerequisites: V22.0301 (Basic Algorithms)

Required textbooks

Stuart Russell and Peter Norvig, Artificial Intelligence: A Modern Approach, 2nd edition. (Be sure you get the second edition, which has a green cover.)


There are many cognitive tasks that people can do easily and almost unconsciously but that have proven extremely difficult to program on a computer. Artificial intelligence is the problem of developing computer systems that can carry out these tasks. We will focus on three central areas in AI: representation and reasoning, learning, and natural language processing.




Problem Set 1 Due Sept. 19.
Solution Set 1
Programming Assignment 1 Due Oct. 12 (note changed date)
Problem Set 2 Due Sept. 26.
Solution Set 2
Problem Set 3 Due Oct. 12.
Solution Set 3
Programming Assignment 2 Due Oct. 31
Problem Set 4 Due Oct. 24.
Solution Set 4
Programming Assignment 3 Due Nov. 28
Problem Set 5 Due Nov. 7.
Solution Set 5
Problem Set 6 Due Nov. 14.
Solution Set 6
Problem Set 7 Due Nov. 21.
Solution Set 7

Course Pack

Table of Contents


Propositional Logic
Davis-Putnam Procedure
Davis-Putnam: Example
Inference in Datalog
Chart parsing example
Building a parse tree
Notes on ambiguity
Compound nouns
ID3 algorithm
ID3 example
Minimum description length learning
Tagging NL text using the K-gram model
Viterbi algorithm


Sample Mid-Term Exam
Solutions to Sample Mid-Term Exam
Solutions to Mid-Term Exam
Notes on the Final Exam.
Sample exam questions from the second half of the course.
Solutions to sample exam questions.


You may discuss any of the assignments with your classmates (or anyone else) but all work for all assignments must be entirely your own. Any sharing or copying of assignments will be considered cheating. By the rules of the College of Arts and Science, I am required to report any incidents of cheating to the department. Department policy is that the first incident of cheating will result in the student getting a grade of F for the course. The second incident, by CAS rules, will result in expulsion from the University.

CS Department policy on academic dishonesty