1. a) Explain in detail about task environments. Also discuss different flavors of task
environments.
b) Given an architecture with n bits of storage, how many different possible agent
programs are there? [8+8]
2. a) Does a finite state space always lead to a finite search tree? How about a finite state
space that is a true? Can you be more precise about what types of stack space always
lead to finite search trees?
b) Discuss in detail about memory bounded heuristic search strategy algorithms. [8+8]
3. a)Describe in detail about backtracking search for CSP’s.
b) Explain in detail about simulated annealing search. [8+8]
4. a) Implement move generators and evaluation functions for chess game. Construct a
general alpha beta game playing agent that uses your implementation. Compare the
effect of increasing search depth, improving move ordering and improving the
evaluation function. How close does your effective branching factor come to the
ideal case of perfect move ordering?
b) Discuss optimal strategies in a normal search problem. Also explain a partial search
tree for tic-tac- toe game. [8+8]
5. a) Discuss in detail about logical equivalence by taking arbitrary sentences , , of
propositional logic.
b) Give a generic knowledge –based agent in detail. [8+8]
6. a) Represent the following sentences in first-order logic using a consistent vocabulary
(which you must define)
i) There is a barber who shaves all men in town who don’t shave themselves.
ii) A person born in UK each of whose parents is a UK citizen or a UK resident
is a UK citizen by birth.
iii) A person born outside the UK, one of whose parents is a UK citizen by birth,
is a UK citizen by descent.
iv) Politicians can fool some of people all of the time, and they can fool all of the
people some of the time, but they can’t fool all of the people all of the time.
b) Prove from first principles that universal instantiation is sound and that existential
instantiation produces an inferentially equivalent known base. [8+8]
7. a) What is meant by planning? Discuss about classical planning problem in detail.
b) Discuss in detail about expressiveness and extension in detail. [8+8]
8. a) Explain about learning with hidden variables.
b) Discuss about learning with complex data and with hidden variables. [8+8]
environments.
b) Given an architecture with n bits of storage, how many different possible agent
programs are there? [8+8]
2. a) Does a finite state space always lead to a finite search tree? How about a finite state
space that is a true? Can you be more precise about what types of stack space always
lead to finite search trees?
b) Discuss in detail about memory bounded heuristic search strategy algorithms. [8+8]
3. a)Describe in detail about backtracking search for CSP’s.
b) Explain in detail about simulated annealing search. [8+8]
4. a) Implement move generators and evaluation functions for chess game. Construct a
general alpha beta game playing agent that uses your implementation. Compare the
effect of increasing search depth, improving move ordering and improving the
evaluation function. How close does your effective branching factor come to the
ideal case of perfect move ordering?
b) Discuss optimal strategies in a normal search problem. Also explain a partial search
tree for tic-tac- toe game. [8+8]
5. a) Discuss in detail about logical equivalence by taking arbitrary sentences , , of
propositional logic.
b) Give a generic knowledge –based agent in detail. [8+8]
6. a) Represent the following sentences in first-order logic using a consistent vocabulary
(which you must define)
i) There is a barber who shaves all men in town who don’t shave themselves.
ii) A person born in UK each of whose parents is a UK citizen or a UK resident
is a UK citizen by birth.
iii) A person born outside the UK, one of whose parents is a UK citizen by birth,
is a UK citizen by descent.
iv) Politicians can fool some of people all of the time, and they can fool all of the
people some of the time, but they can’t fool all of the people all of the time.
b) Prove from first principles that universal instantiation is sound and that existential
instantiation produces an inferentially equivalent known base. [8+8]
7. a) What is meant by planning? Discuss about classical planning problem in detail.
b) Discuss in detail about expressiveness and extension in detail. [8+8]
8. a) Explain about learning with hidden variables.
b) Discuss about learning with complex data and with hidden variables. [8+8]
No comments:
Post a Comment