Solution Set 3
Let D be a domain consisting of individual animals, species, and time periods. Let L be the
rst-order language over D with the following primitives:
Animal(a) Predicate. a is an animal.
SpeciesOf(a,s) Predicate. Animal a belongs to species

Problem Set 4
Assigned: Mar. 21
Due: Apr. 11
Problem 1
Let A,B,C,D,E be ve Boolean random variables. Assume that you are given the following Bayesian
network:
A
C
B
E
D
You are given the following probabilities:
P (A=T) = 0.3.
P (B=T) = 0.9.
P (C=T|A=T,B=

Problem Set 1
Assigned: Jan. 25
Due: Feb. 8
Problem 1
Consider the following scheduling problem. There are N tasks. Each task T has requires unit time
and has value T.V . There is an overall deadline D and a target value M . The tasks are structured
in a

Problem Set 1
Assigned: Jan. 25
Due: Feb. 8
Problem 1
Consider the following scheduling problem. There are N tasks. Each task T has requires unit time
and has value T.V . There is an overall deadline D and a target value M . The tasks are structured
in a