CE DEPARTMENT VVP ENGINEERING COLLEGE

AI QUESTION BANK

1. What are various approaches to knowledge representation? 2. Discuss different issues of knowledge representation in detail. 3. Define in your own words the following terms: agent, agent function, agent program, rationality, autonomy, reflex agent, model based agent, goal based agent, utility based agent, learning agent.

4. What is resolution? Explain resolution by refutation. 5. Trace the operation of the unification algorithm on each of the following pairs of literals: (a) f(Marcus) and f(Caesar) (b) f(x) and F(g(y)) (c) f(Marcus, g(x, y)) and f(x, g(Caesar, Marcus)) 6. Consider the following sentences: John likes all kinds of food. Apples are food. Chicken is food. Anything anyone eats and isnt killed by is food. Bill eats peanuts and is still alive. Sue eats everything Bill eats. (a) (b) (c) (d) (e) Translate these sentences into formulas in predicate logic. Prove that John likes peanuts using backward chaining. Convert the formulas of part a into clause form. Prove that John likes peanuts using resolution. Use resolution to answer the question, What food does Sue eat?

7. Consider the following facts: The members of the Elm St. Bridge Club are Joe, Bill, and Ellen. Joe is married to Sally. Bill is Ellens brother. The spouse of every married person in the club is also in the club. The last meeting of the club was at Joes house.
1|Page

(a) Represent these facts in predicate logic. (b) From the facts given above, would be able to decide on the truth of the following additional statements: The last meeting of the club was at Sally house. Ellen is not married. Can you construct resolution proofs to demonstrate the truth of each of these statements given the five facts listed above? Do so if possible. Otherwise, add the facts you need and then construct the proofs.

8. Assume the following facts: Steve only likes easy courses. Science courses are hard. All the courses in the basket weaving department are easy. BK301 is a basket weaving course. Use resolution to answer the question, What course would Steve like 9. What problems would be encountered in attempting to represent the following the statements in predicate logic? It should be possible to deduce the final statement from others. John only likes to see French movies. Its Playhouse rarely shows foreign films. People dont do things that will cause them to be in situations that they dont like. John doesnt go to the Playhouse very often. 10. Explain the algorithm resolution in propositional logic & predicate logic. 11. Explain the algorithm for unification. 12. Explain declarative knowledge and procedural knowledge. 13. A problem solving search can proceed either forward or backward. What factors determine the choice of direction for a particular problem? If a problem solving search program were to be written to solve each of the following types of problems, determine whether the search should proceed forward or backward: a. Water jug problem b. Blocks world c. Natural language understanding
2|Page

14. Write a note on monotonic and non monotonic reasoning process 15. Explain default reasoning. 16. Explain minimalist reasoning. 17. The classic example of non-monotonic reasoning involved birds and flying. In particular, consider the following facts: Most birds do fly, unless they are too young or dead or have a broken wing. Penguins and ostriches do not fly. Magical ostriches fly. Tweety is a bird. Chirpy is either a penguin or an ostrich. Feathers is a magical ostrich. Use one or more of the non-monotonic reasoning systems we have discussed to answer the following questions: Does Tweety fly? Does Chirpy fly? Does Feathers fly? Does Paul fly?

18. Consider the missionaries and cannibals problem of Section 2.6. When you solved that problem, you used the CWA several times (probably without thinking about it). List some of the ways in which you used it.

19. A big technical problem that arises in defining circumscription precisely is the definition of a minimal model. Consider again the problem of Dick, the Quaker and Republican, which we can rewrite using a slightly different kind of AB predicate as: x : Republican(x) AB 1(x) Pacifist(x) x : Quaker(x) AB 2(x) Pacifist(x) Republican(x) Quaker(x) (a) Write down the smallest models you can that describe the two extensions that we computed for that knowledge base. (b) Does it make sense to say that either is smaller than the other? (c) Prioritized circumscription [McCarthy, 1986] attempts to solve this problem by ranking predicates by the order in which they should be minimized. How could you use this idea to indicate a preference as to which extension to prefer?
3|Page

20. Using MYCINs rules for inexact reasoning, compute CF, MB, and MD of h1 given three observations where CF(h1, o1) = 0.5 CF(h1, o2) = 0.3 CF(h1, o3) = -0.2 21. Show that MYCINs combining rules satisfy the three properties we gave for them. 22. Consider the following set of propositions: patient has spots patient has measles patient has high fever patient has Rocky Mountain Spotted Fever patient has previously been inoculated against measles patient was recently bitten by a tick patient has an allergy (a) Create a network that defines the causal connections among these nodes. (b) Make it a Bayesian network by constructing the necessary conditional probability matrix. 23. Explain various techniques that can be used to argument knowledge representation with Statistical Reasoning process. 24. Construct Semantic net representation for the following: i. ii. iii. iv. v. vi. The dog bit the mail carrier Every dog has bitten a mail carrier Every dog has bitten every mail carrier Mary gave green flower vase to her favorite cousin. Every batter hit a ball All the batters like the pitcher.

25. Construct one consistent frame representation for cricket. 26. Explain Minimax search procedure with algorithm. How it can be improved using alpha beta cut off? 27. Solve tic-tac-toe using minimax search procedure.
28. Explain iterative deepening strategy with depth first iterative deepening and IDA*.

4|Page