CS2710 (ISSP 2160) Foundations of Artificial Intelligence  

CS 2710 (ISSP 2160)  Foundations of Artificial Intelligence


TH 10:30-11:45pm,  Room 5313 (Sennott Square), Fall 2009

Instructor: Dr. Diane Litman
5105 Sennott Square, x4-8838
741 LRDC, x4-1261
e-mail: litman_at_cs.pitt.edu
office hours: H 11:45-1:45 or by appt.
TA: Wenting Xiong
5420 Sennott Square, x4-8462
e-mail: wex12_at_cs.pitt.edu
office hours: TH 9:00-10:30



Schedule  
 
Date  Topic(s)  Assignments Links
I Artificial Intelligence    
9/1 AI

Readings: RN 1 (pdf), 2 (pdf)

How to read a computer science research paper
How to read a research paper
Association for the Advancement of Artificial Intelligence (AAAI)
II Problem-solving    
9/3 Solving problems by searching

Readings: RN 3 (pdf)

DUE: Commentary on AI Growing Up

 
9/8 Informed search (Guest lecturer: Arthur Ward)

Readings: RN 4.1-4.3 (pdf)

DUE: Leave a comment on Blackboard to sign up for (co-)leading one paper/commentary class discussion. The available topics/papers are indicated on this syllabus. Note that each topic may be presented by no more than 3 people (first come first served).  
9/10 Informed search (Guest lecturer: Arthur Ward)

Readings: RN 4.1-4.3 (continued)

   
9/15 Constraint satisfaction problems

Readings: RN 5.1-5.3 (pdf)

DUE: Commentary on Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method (2008 AAAI Classic Paper Award) [Liu, Stokes, Zhou]

ASSIGNED: Homework 1

Constraints: An International Journal

Handbook of Constraint Programming

9/17 Adversarial search

Readings: RN 6.1-6.4 (pdf)

CSP to work on at home for discussion in today's class play checkers with Chinook
III Knowledge and reasoning    
9/22 Propositional logic

Readings: RN 7 (pdf)

DUE: Commentary on The Game of Hex: An Automatic Theorem Proving Approach to Game Programming (2000 AAAI Outstanding Paper Award) [Wenskovitch, Krebs, Maries, Boulos] Hexy plays Hex
9/24 Propositional logic

Readings: RN 7 (continued)

DUE: Homework 1; Example Solutions (Example 1, Example 2)

ASSIGNED: Homework 2 ; tar file for driver program (updated 10/1)

 
9/29 First order logic

Readings: RN 8 (pdf)

  Knowledge Engineering (comic)
10/1 First order logic

Readings: RN 8 (continued)

DUE: Commentary on Ontologies and the Semantic Web (CACM 2008) [Conrad, Xu, Sahebi]  
10/6 Inference in FOL

Readings: RN 9 (pdf)

DUE: Homework 2

ASSIGNED: Homework 3

 
10/8 Knowledge representation

Readings: RN 9 (continued),
10.1-10.2, 10.4-10.9 (pdf)


CNF/Resolution problems to work on at home for discussion in today's class; solutions

DUE: Commentary on A Question-Answering System for AP Chemistry:Assesing KR&R Technologies (Proc. KR 2004) [Ananthasubramanian, Mohamed, Harp]

Principles of Knowledge Representation and Reasoning, Incorporated (KR, Inc.)

Project Halo

Cyc Knowledge Base

10/13 No Tuesday Classes    
10/15 Midterm Review

Readings: RN 10 (continued)

Sample exam

DUE: Homework 3 (due BEFORE class; no late acceptances as answers will be posted after class). Solutions (first, rest)

 
10/20 Midterm Exam
(closed-book, NO makeups)

Coverage: Chapters 1-9

   
IV Planning    
10/22 Situation Calculus, Planning

Readings: RN 10.3, 11.1-3 (pdf)

DUE: Commentary on On the Progression of Situation Calculus Basic Action Theories: Resolving a 10-year-old Conjecture (2008 AAAI Outstanding Paper Honorable Mention) [Garrison] The International Conference on Automated Planning and Scheduling (ICAPS)
10/27 Planning

Readings: RN 11.1-7, graphplan (pdf; pages 1-27), satplan (pdf)

ASSIGNED: Homework 4; background reading

Midterm returned/discussed

 
10/29 Planning

Readings: RN 11 and supplements (continued)

Solving Sussman Anomaly using POP example from class (pdf)

Last class before monitored withdrawal period ends

 
V Uncertain knowledge and reasoning    
11/03 Uncertainty

Readings: RN 11 (finish up), RN 13 (pdf)

DUE: Commentary on Bayesian Classification (2007 AAAI Classic Paper Award) [Wang, Garcia, Anandanpillai]

ASSIGNED: Homework 5 (Writing and Peer Review)

AutoClass
11/05 Uncertainty (Guest Lecturer: Hua Ai) (Pitt page)

Readings: RN 13 (continued), Wumpus (pdf)

   
11/10 Probabilistic reasoning

Readings: RN 14.1-14.2 (pdf)

DUE: Homework 4 Association for Uncertainty in AI
11/12 Probabilistic reasoning

Readings: RN 14.3 (pdf), 14.4 (pdf)

DUE: Commentary on Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach (2000 AAAI Classic Paper Award) [Heim, Cavanaugh, Stachel]  
VI Advanced Topics    
11/17 Decision making

Readings: RN 16 (pdf)

DUE: Homework 5, Part I (First Draft)

ASSIGNED: Homework 6

 
11/19 Decision making

Readings: RN 16 (pdf), 17.1-17.2 (pdf, more pdf)

   
11/24 Learning from observations

Readings: RN 17 (continued), case study (pdf), RN 18.1-18.4 (intro)

  International Machine Learning Socity
12/1 Learning from observations

Readings: RN 18.1-18.4 (intro, pdf)

DUE 12/1: Homework 5, Part II (Peer Reviews)

Value iteration examples discussed in class (slides 14, 24 - but latter has bugs, find them!), plus much more (pdf)

Weka
12/3 Learning from observations

Readings: RN 18.1-18.3 (pdf)

   
12/8 Learning

Readings: RN 18.1-18.3 (more pdf), 18.4 (pdf)

DUE: Homework 6; solution Boosting

Netflix contest and data

12/10 Communication

Readings: RN 22 (intro) (pdf)

DUE: Commentary on PLOW: A Collaborative Task Learning Agent (2007 Outstanding Paper Award) [Ko, Jung, Betz]

DUE: Homework 5, Part III (Final Version, Back Reviews)

Association for Computational Linguistics
12/15 Communication/Course review

Readings: RN 22 (continued)

DUE: Homework 5, Part IV (Peer Evaluation)

Last "Homework" (to do at home) and solutions (ps); sample (non prelim) exam

 
12/17 Final Exam / AI Prelim
(closed book, NO makeups)

Coverage: Cumulative

Note that for graduate courses there is no special schedule, so our exam is at the regular class time, regular place.

   



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, uncertainty, and advanced topics.

Prerequisites: undergraduate level AI (CS 1571 or equivalent) or the permission of the instructor

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 to obtain the correct (green color cover) edition. The 3rd edition unfortunately is available only for preorder at this time.

Additional readings: Links to research papers will be found under the Assignments section of the syllabus. The procedure for commenting on these papers is described here.



Grading
  • Readings/Peer Feedback  10 %
  • Homework assignments    45 %
  • Midterm                           20 %
  • Final                                 25 %



Homeworks

There will be regular homework assignments. The homeworks will include a mix of paper and pencil problems, and programming assignments. The assignments are due by 11:59pm on the day specified on the assignment. In general, no extensions will be granted.

Programming assignments. Please see the rules for submitting programming assignments.

Absences and late assignments. If an absence is unavoidable, you are still responsible for making arrangements to turn in the assignments on time. You are also responsible for obtaining any materials passed out and the information announced during the missed class. In case of extraordinary circumstances (hospitalization, family emergency) you should contact me as soon as possible so that we may arrange an extension for assignments prior to the due date. Documentation will be required. In all other cases, if an assignment can be accepted late, the penalty is 10% per day up to 5 days including Saturday, Sunday, and holidays. Assignments are due by 11:59pm on the due date. The timestamp on the dropbox or ftp submission will be used as well. There are NO makeup possibilities for exams.



Academic Integrity

All the work in this course except for presentation of papers should be done independently. Collaborations on homeworks are not permitted. Cheating and any other antiintellectual behavior, including giving your work to someone else, will be dealt with severely. If you feel you may have violated the rules speak to us as soon as possible.

Please make sure you read, understand and abide by the University's Academic Integrity Code . Students in this course will be expected to comply with the University of Pittsburgh's Policy on Academic Integrity. Any student suspected of violating this obligation for any reason during the semester will be required to participate in the procedural process, initiated at the instructor level, as outlined in the University Guidelines on Academic Integrity. This may include, but is not limited to, the confiscation of the examination of any individual suspected of violating University Policy. Furthermore, no student may bring any unauthorized materials to an exam, including dictionaries and programmable calculators.


Students With Disabilities

If you have a disability that requires special testing accommodations or other classroom modifications, you need to notify both the instructor and the Disability Resources and Services no later than the 2nd week of the term. You may be asked to provide documentation of your disability to determine the appropriateness of accommodations. To notify Disability Resources and Services, call 648-7890 (Voice or TTD) to schedule an appointment. The Office is located in 216 William Pitt Union.


Thanks

Notes include materials from Pitt Professors Hauskrecht, Hwa, and Wiebe, from the AIMA page, and from others on the web.