# Artificial Intelligence

V22.0472.001

Tuesday and Thursday, 11:00-12:15

Room 513, Warren Weaver Hall

**Professor Ernest Davis**
### Reaching Me

- phone: (212) 998-3123
- office: 329 Warren Weaver Hall
- office hours: Monday, Wednesday, 11:00-1:00, or by appointment.
- email:

### Class mailing list

You should subscribe to the class email list at
this link.
**Prerequisites:** V22.0201 (Computer Systems Design I) and
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: natural language processing,
representation and reasoning, and learning.
### Requirements

- Weekly problem sets and programming assignments (40% of the grade)
- Midterm (20% of the grade).
- Final Essay (10% of the grade)
- Final Exam (30% of the grade)

### Topics

- Natural Language Processing (Chap 22,23)
- Logic and Automated Reasoning (Chap 7,8)
- Reasoning with Uncertainty (Probabilistic reasoning) (Chap 13,14)
- Machine Learning (Chap 18)

If time permits, we may also discuss planning (chap 11) and/or knowledge
representation (chap 10).
### Assignments

Final Essay Due Dec. 11.

Problem Set 1 Due Sept. 18.

Solution Set 1

Programming Assignment 1 Due Oct. 4.

Problem Set 2 Due Sept. 25.

Solution Set 2

Programming Assignment 2 Due Nov. 1.

Problem Set 3 Due Oct. 2.

Solution Set 3

Problem Set 4 Due Oct. 11.

Solution Set 4

Problem Set 5 Due Oct. 18.

Solution Set 5

Problem Set 6 Due Nov. 8.

Programming Assignment 3 Due Nov. 29.

Problem Set 7 Due Nov. 20.

### Handouts

Recursive Descent Parsing

Chart parsing
example

Building
a parse tree

Notes on
ambiguity

Compound
Nouns: Examples

Propositional Logic

Davis-Putnam Procedure

Davis-Putnam: Example

Examples of first-order languages and sentences

Guide to Expressing Facts in a First-Order Language

Inference in Datalog

Trace of the subroutine "consequences"

Independent Evidence

Bayesian Net Example

Naive Bayes for Classifying Text

Linear Separators and Support Vector Machines

Entropy

Tagging NL text using the K-gram model

Viterbi algorithm

Viterbi example

1R learning algorithm

ID3 algorithm

ID3 example

Clustering Algorithms

Minimum description length learning

### Exams

The mid-term will take place Tuesday Oct. 23.

Mid-term announcement

Sample mid-term

Mid-term solutions

The final exam will be given Tuesday, Dec. 18, 12:00-1:50.

Notes on the Final Exam

Sample Questions from the 2nd half of the course

Solutions to the 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