CSCI 4511W Midterm: CS 4511 UMN Midterm 2 f08
Document Summary
Show the backed-up values for all the nodes in the following game tree and show the branches that are pruned by alpha-beta. For each branch pruned, explain brie y why alpha-beta prunes it. Follow the convention used in the textbook to examine the branches in the tree from left to right. max min max min. Show the results of applying the uni cation algorithm to the following ex- pressions: unify[p(x, f(u,x)), p(f(y,a), f(z,f(b,z)), unify [p(g(a), h(u,v)), p(g(w), h(w,b)), 5 points. Convert to conjunctive normal form the following expression: P[pet(p) c[owner(c, p) f eeds(c, p)]] happy(p) Turn to the next page for more questions: 20 points, write the following statements in predicate calculus, using the following predicates: Friend(x,y) : x is a friend of y. For each of the following sentences, decide if the logic sentence given is a correct translation of the english sentence or not. If not explain brie y why not and correct it.
