B.Tech.(CSE) VI Sem.

2012 AI365: Articial Intelligence Assignment # 1

ere will not be a class of AI on 6-2-2012. 1. Suppose that we represent Sam is Bills fatherby father(bill, sam) and Harry is one of Bills ancestorsby ancestor(bill, harry). Write a w to represent Every ancestor of Bill is either his father, his mother, or one of their ancestors. 2. Represent the following sentences by predicate calculus ws. (a) A computer system is intelligent if it can perform a task which, if performed by a human, requires intelligence. (b) A formula whose main connective is is equivalent to a formula whose main connective is . (c) If a program cannot be told a fact, then it cannot learn that fact. (d) If a program system is commutative, then, for any database, D, each member of the set of rules applicable to D is also applicable to any database produced by applying an applicable rule to D. 3. Show that modus ponens in propositional calculus is sound. 4. Show that (z)(x)[p(x) q(z)] and (z)(x)p(x) q(z)] are equivalent. 5. Convert the following formulas to clause form: (a) (x)(y){[p(x, y) q(y, x)] [q(y, x) s(x, y)]} (x)(y)[p(x, y) s(x, y)] (b) (x){p(x) {(y)[p(y) p(f (x, y))] (y)[q(x, y) p(y)]}}} 6. Show that resolution theorem is sound. 7. Give an example of a problem where BFS will work than DFS. Also give an example, where DFS will work better than BFS. 8. For the graph in gure 1, list the nodes sequences explored for reaching from start node A to goal node G in the following search: (a) BFS (b) DFS (c) Iterative deepening DFS (d) Hill climbing method (e) Best-rst rst search 9. Compute the (a) No. of rst moves(i.e. from start state), (b) no. of total moves, (c) no. of total states to be generated for reaching to goal, (d) maximum depth of the tree. for the following puzzles: 1

Figure 1: Graph. (a) tic-tac-toe (b) farmer, wolf, cabbage, goat 10. Construct a prolog prolog, run and test for a preliminary selection process, using the following database: qulify(U, V, W, X, Y, Z). where U is numeric enrollment number, V is name, W is number of prizes won, and X, Y, Z are percent scores in 10th, 11th, 12th. Only those candidates should be listed on the query, with all the details, which have any one of the following qualications: have one 3 prizes, and have 10th score 75%, and 11th and 12th scores are at least 70% have no prizes won, have 10th scores of minimum 60% and 11th minimum of 60% and 12th score of minimum 75% have won one prize, 10th score of 90% or higher, 11th and 12th minimum of 60% 11. Given the graph shown in gure 2, construct prolog program, and apply the queries to nd out if there is path between any two cities?

Figure 2: Cities with links. Note: 1. Submission deadline 23rd Feb. 2012(without any further extension), in hard copy. Plagiarism is oense, penalty may be deduction of complete scores of both parties whose answers were found verbatim in one or more questions. 2. Neatness of work and completeness of the answers is encouraged.