CS 1571  Introduction to Artificial Intelligence


Time:  MW 3:00-4:15pm,  5129 Sennott Square



Instructor:  Milos Hauskrecht
5329 Sennott Square, x4-8845
e-mail: milos_at_cs_dot_pitt_dot_edu
office hours: Tuesday 1:30-3:00pm
 

TA: Swapna Somasundaran
5422 Sennott Square
e-mail: swapna_at_cs_dot_pitt_dot_edu
office hours: Tuesday: 4:30-6:00pm, Thursday 3:00-4:30pm
 



Links

Course description
Lectures
Grading
Homeworks
 

Announcements (check often)



Course description

This course will provide an introduction to the fundamental concepts and techniques underlying the construction of intelligent computer systems. Topics covered in the course include: problem solving and search, logic and knowledge representation, planning, reasoning and decision-making in the presence of uncertainty, and machine learning.

Prerequisites:  CS 1501, CS 1502
 

Textbook:

Stuart Russell, Peter Norvig. Artificial Intelligence.  A modern approach. 2ed. Prentice Hall, 2002.
Note: The second edition of the book was published at the end of 2002. There are significant changes as compared to the first (1995) edition of the book. Please make sure you get the new (green color cover) edition.
 



Lectures   tr>
 
Lectures  Topic(s)  Assignments
August 28 Administrivia and course overview.

Readings: RN - chapters 1, 2.

August 30 Problem solving by searching.

Readings: RN - sections 3.1-3.4

September 6 Problem solving by searching.

Readings: RN - sections 3.1-3.4

September 11 Uninformed search methods I

Readings: RN - sections 3.4

September 13 Uninformed search methods II

Readings: RN - sections 3.4

Homework assignment 1
Programs for hw-1
September 18 Uninformed search methods III.
Informed search methods I.

Readings: RN - sections 4.1.

September 20 Heuristic search. Greedy and A* search.

Readings: RN - sections 4.1., 4.2.

Homework assignment 2
Programs for hw-2
September 25 IDA*.
Constraint satisfaction search.

Readings: RN - sections 5.1-2.

Solutions for homework 1
September 27 Constraint satisfaction search. Constraint propagation.

Readings: RN - chapter 5

Homework assignment 3
October 2 Search for the optimal configuration. Hill climbing and simulated annealing.

Readings: RN - chapter 4

October 4 Search for the optimal configuration. Genetic algorithms. Gradient-ascend.

Readings: RN - chapter 4

Homework assignment 4
Programs for hw-4
October 9 Adversarial search

Readings: RN - chapter 6

October 16 Knowledge representation. Propositional logic.

Readings: RN - chapter 7

Homework assignment 5
Programs
October 18 Knowledge representation. Propositional logic. Logical inference problem.

Readings: RN - chapter 7

October 23 Knowledge representation. Propositional logic. SAT and resolution refutation.

Readings: RN - chapter 7

October 25 Midterm exam

Readings: RN: Search

Homework assignment 6
October 30 Propositional logic. Horn normal form. Forward and backward chaining.

Readings: RN - chapter 7

November 1 First order logic.

Readings: RN - chapter 8

Homework assignment 7
November 6 First order logic. Inference I.

Readings: RN - chapter 9

November 8 First order logic. Inference II.

Readings: RN - chapter 9

Homework assignment 8
November 13 Planning. Situation calculus.

Readings: RN - chapter 10.3

November 15 Planning. STRIPS.

Readings: RN - chapter 11

Homework assignment 9
November 20 Planning. Hierarchical and contingency planners.
Modeling uncertainty.

Readings: RN - chapter 11,13

November 27 Modeling uncertainty with probabilities

Readings: RN - chapter 13

November 29 Bayesian belief networks

Readings: RN - chapter 14

Homework assignment 10
December 4 Bayesian belief networks. Inference.

Readings: RN - chapter 14

December 6 Decision making in the presence of uncertainty.
Review

Readings: RN - chapter 14

December 11 Final exam



Grading

Homeworks

There will be weekly homework assignments. The homeworks will include a mix of paper and pencil problems, and programming assignments. The assignments are due at the beginning of the class on the day specified on the assignment. In general, no extensions will be granted.

Collaborations. Collaborations on homeworks are not permitted. Cheating and any other antiintellectual behavior will be dealt with severely. If you feel you may have violated the rules speak to us as soon as possible.

Programming assignments. Knowledge of C/C++ language is neccessary for the programming part. C/C++ programs submitted by you should compile with g++ compiler under unix. Please see the rules for submitting programming assignments.


Students With Disabilities:
If you have a disability for which you are or may be requesting an accommodation, you are encouraged to contact both your instructor and Disability Resources and Services, 216 William Pitt Union, (412) 648-7890/(412) 383-7355 (TTY), as early as possible in the term. DRS will verify your disability and determine reasonable accomodations for this course.
 



Last updated by milos on 08/17/06