Time: MW 11:00-12:15pm, Room
5313 (Sennott Square), Fall 2006
|
|
Lectures | Topic(s) | Assignments | |
---|---|---|---|
August 28 | Artificial Intelligence | ||
August 30 |
Solving problems by searching
Readings: RN 3.1-3.5 (ppt) |
||
September 6 |
Informed search (Guest
lecture by Joel Tetreault)
Readings: RN 4.1-4.3 (ppt) |
Read before September 11 class: H ow to read a research paper (1) How to read a computer science research paper How to read a research paper (2) |
|
September 11 |
Informed search
Readings: RN 4.1-4.3 (ppt) (continued) | ||
September 13 |
Constraint Satisfaction Problems
Readings: RN 5.1-5.3 (ppt) |
Homework 1 assigned (solution) |
|
September 18 |
Adversarial search (Lecture by Mahmoud)
Readings: RN 6.1-6.3 (ppt) |
||
September 20 |
Propositional logic (Lecture by Mahmoud)
Readings: RN 7.1.-7.5 (ppt) |
||
September 25 |
Propositional logic
Readings: RN rest of 7 (ppt) |
||
September 27 |
First order logic
Readings: RN 8 (ppt) |
||
October 2 |
First order logic (continued) (Lecture by Mahmoud)
Readings: RN 8 |
Homework 1 due; Homework 2 assigned (solution) | |
October 4 |
Inference in FOL
Readings: RN 9 (ppt) |
||
October 9 |
Knowledge Represention
Readings: RN 10 (ppt) |
Commentary on Hector J. Levesque and Ronald J. Brachman, A Fundamental Tradeoff in Knowledge Representation and Reasoning (from Readings in Knowledge Representation) (handout) (2004 AAAI Classic Paper Honorable Mention) |
|
October 11 |
KR (continued)
Readings: RN 10 |
Homework 2 due | |
October 16 |
Midterm Review, Planning
Readings: RN 11.1-11.3 (pdf) |
||
October 18 |
Midterm Exam (closed-book, NO makeups)
Coverage: Chapters 3-10 |
||
October 23 |
Planning
Readings: RN 11.4-11.5 (more planning pdf, graphplan pdf (pages 1-27), satplan ppt) |
Homework 3 assigned (solution) | |
October 25 |
Planning (continued)
Readings: RN 11.4-5 |
||
October 30 |
Uncertainty
Readings: RN 13 (ppt) |
Commentary on Reactive Reasoning and Planning (2006 AAAI Classic Paper Award) | |
November 1 |
Uncertainty (continued)
Readings: RN 13 Wumpus World (pdf) |
Commentary on Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach (handout) (2000 AAAI Classic Paper Award) | |
November 6 |
Probabilistic Reasoning
Readings: RN 14.1-14.2 (pdf) | Homework 3 due (solution) (see script.tar if you want to use the grading code with your program); Homework 4 assigned | |
November 8 |
Probabilistic Reasoning
Readings: RN 14.1-14.2 (continued) |
||
November 13 | Probabilistic Reasoning | ||
November 15 | Learning from Observations
Readings: RN 18.1-18.4 (pdf) |
Commentary on The Lumiere Project: Bayesian User Modeling for Inferring the Goals and Needs of Software Users | |
November 20 | Learning from Observations
Readings: RN 18.1-18.4 |
Homework 4 due (solutions pdf, doc), Homework 5 assigned | |
November 27 | Learning from Observations | Commentary on Irrelevant Features and the Subset Selection Problem | |
November 29 | Communication
Readings: RN 22 (pdf) |
||
December 4 | Communication, Decision Making
Readings: RN 22 (continued), 16 (pdf: stop at game search) |
Homework 5 due | |
December 6 | Decision Making
Readings: RN 16 (continued) (pdf: start at Utility theory, see also pdf) |
Commentary on Computing Machinery and Intelligence (original Turing Test paper) | |
December 11 | Course review | ||
December 13 | Final Exam / AI Prelim (closed book, NO makeups) Exam is cumulative and will be 2 hours (enforced), you can start at EITHER 10 or 10:30. |
Links to research papers will be found under the Assignments section of the syllabus. The procedure for commenting on these papers is described here.
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 new (green color cover) edition.
There will be regular 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.
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 at the start of class. The timestamp on the dropbox submission will be used as well. There are NO makeup possibilities for exams.
All the work in this course 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 Academic Integrity Code for the Faculty and College of Arts and Sciences.
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.
Acknowledgements
Claire Cardie, Milos Hauskrecht, Kathy McKeown, Janyce Wiebe, R&N site