

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The final exam for cs498 section ea at uiuc, autumn 04. The exam covers topics on bayes nets, situation calculus, probabilistic graphical models, dynamic probabilistic graphical models, and paramodulation. Questions include identifying the markov blanket of a variable, semantics of bayes nets, number of parameters required for a belief state, time complexity of marginal computation, gibbs sampling convergence, formalizing the hanks-mcdermott shooting problem in situation calculus, deciding d-separation in a bayes network, smoothing in a dbn, and proving statements using paramodulation.
Typology: Exams
1 / 2
This page cannot be seen from the preview
Don't miss anything!


Circle the most appropriate answer
(a) over a Bayes Net that is fully factored (b) over a Markov Field that is fully connected (c) over a Bayes Net with an OR node (X takes the value X = Y ∨ Z deterministically) (d) over a naive-Bayes model
The Hanks-McDermott shooting problem (sometimes refered to as the “Yale shooting Problem”) is the following story: A person can be either ALIVE or DEAD. A gun can be either LOADED or UNLOADED. At a known situation the person is alive. A gun becomes loaded whenever a LOAD action occurs. Any time a person is shot (i.e., a SHOOT action) with a loaded gun, he becomes dead.
Joe’s phone number is the same as Jill’s phone number. We know that this can happen only when the two people live in the same house. Mary lives in the same house as Bob, but they have different phone numbers. Finally, we also know that Joe’s house has exactly one phone line.