Q1. (a) Use A* algorithm to find the shortest path from Philadelphia to Erie.

The table below lists the estimate of the distances between the various places. (1.5) (b) Is the heuristic admissible ? Explain why admissibility makes A* optimal . (1.5)

Q2. (a) Transform the following statement into First Order Predicate Logic, and then use resolution to prove the statement some dog likes people. (1.5) Every dog either likes people or hates cats. Rover is a dog. Rover loves cats. (b) Given the predicates below, convert the statements into clauses and use resolution to answer the question What does Tom like to eat? (1.5)
x : y : cat ( x) fish( y ) likes _ to _ eat ( x, y ) x : calico( x) cat ( x) x : tuna ( x) fish( x) tuna (Charlie) tuna ( Herb) calico(Tom)

Q3. (a)

(a) Compute the probability that a student who did well on the test actually understood the material. (1) (b) For each of the below answer if the following is true or not (1.5) I. T and U are conditionally independent given I, E, and H.
II. III. T and U are conditionally independent given I and H. E and H are conditionally independent given U, I, and T.

(c) Explain how independence and conditional independence of variables in a domain can be utilized to reduce the prior knowledge required for reasoning. (1.5)