Tuesday and Thursday, 11:00-12:15
Room 513, Warren Weaver Hall
Professor Ernest Davis
- phone: (212) 998-3123
- office: 429 Warren Weaver Hall
- office hours: Monday 5:30-7:00 and Friday 10:30-11:30.
Class mailing list
You should subscribe to the class email list at
Prerequisites: V22.0201 (Computer Systems Design I) and
V22.0301 (Basic Algorithms)
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.
- Weekly problem sets and programming assignments (45% of the grade)
- Midterm (20% of the grade).
- Final (35% of the grade)
If time permits, we may also discuss planning (chap 11) and/or knowledge
representation (chap 10).
- Search (Russell and Norvig chap. 3,4)
- Game playing (Chap. 6)
- Logic and Automated Reasoning (Chap 7,8)
- Reasoning with Uncertainty (Probabilistic reasoning) (Chap 13,14)
- Machine Learning (Chap 18)
- Natural Language Processing (Chap 22,23)
Problem Set 1. Due Sept. 14.
Programming Assignment 1. Due Sept. 28.
Solution Set 1.
Problem Set 2. Due Sept. 26.
Solution Set 2.
Programming Assignment 2. Due Oct. 26.
Problem Set 3. Due Oct. 10.
Solution Set 3.
Problem Set 4. Due Oct. 17.
Solution Set 4.
Problem Set 5. Due Oct. 31.
Solution Set 5.
Programming Assignment 3. Due Nov. 28.
Problem Set 6. Due Nov. 7.
Solution Set 6.
Problem Set 7. Due Nov. 14.
Solution Set 7.
Problem Set 8. Due Dec. 12.
Solution Set 8.
Guide to Expressing Facts in a First-Order Language
Inference in Datalog
Trace of the subroutine "consequences"
Bayesian Net Example
Recursive Descent Parsing
a parse tree
Tagging NL text using the K-gram model
Viterbi algorithm : Optional
Viterbi example: Optional
1R learning algorithm
Minimum description length learning
Sample Mid-term Solutions
Solutions to Mid-term Exam
Notes on Final Exam
Sample Questions from Second Half of Course
Solutions to Sample Questions
Solutions to Final Exam
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