Introduction to Artificial Intelligence
V22.0480.001
Monday and Wednesday, 2:00-3:15
Room 101, Warren Weaver Hall
Professor Ernest Davis
Reaching Me
- e-mail
davise@cs.nyu.edu
- phone: (212) 998-3123
- office: 429 Warren Weaver Hall
- office hours: Monday 4:30-6:00, Thursday 10:00-11:00
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.)
Description:
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.
Requirements
- Weekly problem sets. (15% of the grade)
- 3 programming assignments (30%
of the grade).
- Midterm (20% of the grade).
- Final (35% of the grade)
Topics
- 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)
If time permits, we may also discuss planning (chap 11) and/or knowledge
representation (chap 10).
Grader
The grader for this class is Chien-I Liao. Email: cil217@nyu.edu
Chien-I has written up
instructions for submitting assignments which you should read and follow.
Chien-I has also written some
notes on programming assignments 1 and 2.
Assignments
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
Handouts
Propositional Logic
Davis-Putnam Procedure
Davis-Putnam: Example
Davis-Putnam: Example 2
Compiling the bounded Post Correspondence problem to
satisfiability. (Optional)
Guide to Expressing Facts in a First-Order Language
Inference in Datalog
Chart parsing example
Building a parse tree
Notes on ambiguity
1R learning algorithm
ID3 algorithm
ID3 example
Minimum description length learning
Tagging NL text using the K-gram model
Viterbi algorithm
Viterbi example
Exams
Mid-Term Exam: Announcement Wed. Oct. 26.
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.
Solutions to final exam.
Cheating
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