AI November 2010 Set3

IV B.Tech I Semester Regular Examinations, November 2010
ARTIFICIAL INTELLIGENCE
( ECC )
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
1. In the history of AI? Explain the following:
(a) Knowledge base systems are key to power
(b) AI becomes science. [16]
2. What is a greedy best first search? Explain with example and diagram. [16]
3. (a) “Hill climbing behaviour is a straight line but best-first search keeps tracks of
all lines”. Justify above statement with an example.
(b) Write about local maximum and global maximum in hill climbing. [12+4]
4. (a) Is exhaustive search for games such as chess is possible? Explain with your
own measures.
(b) Explain secondary research. [8+8]
5. (a) Describe a generic knowledge based agent.
(b) What are the problems with propositional logic?
(c) How can a knowledge-based agent be made fully autonomous. [6+6+4]
6. (a) Explain the backward chaining algorithm.
(b) Explain inference procedure using resolution with refutation.
(c) For each of the following pairs of atomic sentences, give the most general
unifier if it exists.
(a) f(x) and f(g(y))
(b) f(Marcus,g(x,y)) and f(x,g(Caeser,Marcus)) [8+4+4]
7. (a) Write on language of planning problems
(b) Explain classical planning problem. [8+8]
8. (a) Give the general model of learning agents
(b) Explain inductive learning. [8+8]