EECS 391: Intro to AI
Homework 5 Solution
1. Prove or give a counterexample: (i) If P (A|B, C ) = P (B |A, C ) then P (A|C ) = P (B |C ). (ii) If
P (A|B ) = P (A) then P (A|B, C ) = P (A|C ). A, B , C are arbitrary random variables. (10 points)
EECS 391: Introduction to AI
Email: [email protected]
Office: Olin 516
Office hours: TBA
Soumya Ray, Case Western Reserve U.
HW1 will be posted online and on blackboar
EECS 391: Introduction to AI Written Homework 2 Solution
1. Consist heuristic is admissible
Assume that for a node n0, an optimal path n0 n1 ng leads to the goal node ng.
(Observe that if there is no path to the goal from some node, the path cost can be t
EECS 391: Introduction to AI (Spring 2014) Written Homework 4 Solution
1. Existential Introduction rule:
The Existential Introduction rule can be written as:
Where is a sentence, =cfw_x/g, where g is a ground term in and x does not occur in .
EECS 391: Introduction to AI (Spring 2014) Written Homework 3 Solution
1. Prove the following assertions
a. If is valid, then is true for all models; so is true in all models where True is true (since True is
also true for all models). So True |=.
EECS 391: Introduction to AI (Spring 2014) Written Homework 1 Solution
1. This is an open question. Any reasonable answer is OK.
2. This is an open question. Any reasonable answer is OK.
3. No. The intractability results in question are worst-case. In oth