Ai Dec 2002

641 B. E. (Compt. Science) VIllth ~emester Examination, December-2002

ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEM PaperCSE-404 C Time allowed: 3 hours

Maximum Marks: 100

Note: The students have to attempt at lea."t ty.'(1 questions from each

part andfive questions in all. Part-A 1.

Show how means-ends analysis could be used to solve the problem of getting from one pla~e to another. Assume that the available operators are walk. drive, take the bus, take a cab and fly. Also write algorithm for the same. 20

2.

Write AO*algorithm and explain it with the help of an example. Give reason, why is the algorithm best suited for interactive search . 20

3.

Differentiate between the following"; (i)

Depth-first-search and breadth-first-search

(ii)

Simple hill-climbing and steepest-hilI-climbing

(iii

AI and Expertsystenis.

4. (a))

8,6, 6

Explain the following, giving examples; (i) When would best-first search be worse than simple breadth-first search? (ii) Heuristic functions (iii) Problem space.

641-300 P-2 (Q-8)

IO P.T.O ..

(2) (b) . Give various problem characteristics based on which we can choose inost appropriate method for a particular problem. ; ·10

Part-B · 5. (a)

(I-»

....

Th?t!~~$e!llantic nets and their uses. Show how could we represent a non-binary predicate with semantic nets. ]0 Draw semantic net fnr ,he 't::;~m'rJt given beL.:\'. :

3. 6.

Construct a frame representation of the baseball knowledge, showing classes and metaclasses. 20

7.

Consider the following sentences : (i)

John lik;esclil,kinds of food.

(ii)

Apples are food.

(iii)

Chicken is food.

(iv)

Anything anyone eats and isn't killed by is food.

(v)

Bill eats peanuts and is still alive.

(vi)

Sue eats everything Bill eats. (a) Translate these into formulas in predicate logic, and then into clause fonn. 10 (b) Prove that John likes peanuts, using backward chaining and using resolution. 10

8. (a)

(h )

641-300

Explain the difference between forward and backward chaining and under what conditions each would be best to use for a given set of problems. ] 2 Explain dependency directed b;)cklracking.

8