C677: Reasoning About Uncertainty - Fall '05
- Instructor:
- Joe Halpern, 4144 Upson, halpern@cs, 5-9562
- Admin:
- Cindy Robinson, 4146 Upson, cindy@cs, 5-0985
- Grader: Leandro Rego (lcr26@ece.cornell.edu)
-
- Classes:
- Tuesday, Thursday 1:25 - 2:40, Upson 109 *NOTE ROOM CHANGE*
- Office hours:
- Wednesday, 11-12, or by appointment *NOTE TIME CHANGE*
- Text:
- Reasoning About Uncertainty (Halpern).
(It should be available in the bookstore.) It is now out in paperback
(as of Aug. 15), although the bookstore might not have the paperback
copy yet. Either the hardcover or paperback would be fine for the
course. (The paperback corrects a few typos in the hardcover and is
significantly cheaper.)
- Here is a list of typos in the paperback
version (and the most significant typo in the hardcover that was
corrected in the paperback).
- Course Description and Outline:
-
Agents must reason and act in an uncertain world. In order to do so
intelligently, they need to deal with and reason about this
uncertainty. This course discusses modeling and reasoning about
uncertainty, going from purely qualitative notions (an event is either
possible or it is not) to quantitative notions such as probability (an
event has probability .8), with some consideration of in-between notions
of plausibility. I'll consider various logics of reasoning about
uncertainty, both propositional and first-order, and discuss the
subtleties they reveal. Finally, depending on time, I'll discuss how these
approaches give us tools to understand and analyze central problems in
the literature, including nonmonotonic reasoning, belief change,
counterfactual reasoning, and problems of statistical inference,
particularly that of going from statistical information to degrees of
belief. Although many of the examples will be drawn from the AI
literature, the material is also relevant to distributed systems,
philosophy, statistics, and game theory; I will try to make connections
to work in all these areas.
We will be following the text very closely. (It was based on the
course.) We'll definitely cover
the first 7 chapters of the text; where we go from there depends partly
in class interest.
- Prerequisites:
- None, beyond basic background in
propositional logic and probability theory. (Understanding truth
assignments is enough for propositional logic; for probability theory,
it's enough to know basic probability, and conditional probability.)
However, mathematical maturity is strongly advised. What that means is
familiarity with writing up proofs. Any solid theoretical math course
will give you that, as will theoretically-oriented CS courses.
- Grading:
- There will be no tests or final examination.
There will be problems handed out (roughly 2-3/week). In order to get a
grade, you must sign a form saying you've done all the required reading.
There will be problems handed out, typically 2-3 every Thursday, from the
book. The grade will be based completely on your performance on the
problems. Problems are always due two weeks after they're handed out.
If you hand them in one week after they're handed out (strongly
recommended!), I will grade them
and return them the following week, and you get to hand them in again,
to improve your grade. On a redo, you can get a maximum of 1 point
less than the original value of the problem. (That is, if the problem
was originally out of 10, the most you can get is 9.) I will take the
higher grade.
- Academic Integrity:
- It's OK to discuss the problems with
others, but you MUST write up solutions on your own, and
understand what you are writing.
- Homework
- Thursday, Sept. 1: 2.5, 2.14, 2.16
- Thursday, Sept. 8: 2.28, 2.36, 2.57
- Thursday, Sept. 15: 3.2, 3.7, 3.8
- Thursday, Sept. 22: 3.16 (5 points), 3.23, 3.41 (5 points), 3.44
- Thursday, Sept. 29 (due Tues. Oct. 18; early hand-in date Oct. 6):
3.47, 4.18, 4.24 (a),(b),(c).
- Thursday, Oct. 6 (due Thurs. Oct. 27 -- note this is three weeks,
not two; early hand-in date Oct. 21): 4.8, 5.5, 5.8. Look over (but
don't hand in) 5.7. This is an analysis of the two-envelope problem
that Dov Samet talked about in his colloquium.
(Note that there's a missing assumption in Lemma 4.3.3, which you're
supposed to prove for Exercise 4.8. Check out the list of
typos. Note the earlier fix to Lemma 4.3.3 has
been updated, as of 10/17.)
- Thursday, Oct. 20: 5.10, 5.15, 5.18
- Thursday, Oct. 27: 6.4, 6.6, 6.7 (check out the typo list for some typos relevant to 6.4.
(This is due Nov. 15, since class is cancelled on Nov. 10.)
- Thursday, Nov. 3: 6.14, 6.15, and 6.18. (Again, this is due for the first
time on Nov. 15, since class is cancelled on Nov. 10.)
- Tuesday, Nov. 15: 7.10, 7.11, 7.22 (due Nov. 29; early deadline
Nov. 22)
Breaking news
- Sept. 29: There will be no class on Tuesday, Oct. 4 and Thursday,
Oct. 13.
- Aug. 30: From now on, we'll be meeting in Upson 109, not Rhodes 484
- Aug. 31: From now on, my office hours will be Wednesday 11-12 (not
1:30 - 2:30). If that time doesn't work, please email me to set up an
appointment.
- Nov. 3: Class is cancelled on Nov. 10 (I'll be out of town). Sorry
about that ...