The exam will be open book and notes.

The exam will consist of the following types of problems:

Domain splitting for constraint satisfaction and variable elimination for optimization.

Modeling the independence structure of a task domain using Bayesian networks (especially section 6.3[P]).

D-separation in Bayesian networks. Note that the textbook does not define d-separation precisely, but you need to know what it is and how to use it solve problems such as 6.2 [P].

Variable elimination for belief update (esp. 6.4.1[P]), including the bucket elimination technique, which is described in handouts and lecture notes. Be familiar with the visit-to-Asia example.

Representing simple problems in first-order logic and proofs by resolution refutation proofs. Note that resolution refutation is described in the lecture notes, with several examples. Please study the examples carefully and be prepared to apply the technique to similar examples.

Simple logic programs such as the ones in section 12.5[P].

There will be no questions on other topics.

The reference [P] is to the version of Poole and Mackworth's book uploaded to blackboard (version of 2009-08-17). Newer versions should work fine too.