Assignment

1. (a) Describe the following terms:

i. Heuristic Function
ii. Software Agent

(b) Write a context free grammar that can accept the sentence: "Ram hit the ball".

(c) In the following two-ply game tree, the terminal nodes show the utility values computed by the
utility function. Use the Minimax algorithm to compute the utility values for other nodes in the given
game tree.

d) Find whether the following set is unifiable or not. If unifiable, find the most general
unifier(m.g.u.).
w = { PARENTS(x, FATHER(x), MOTHER(bill)) , PARENTS(bill, FATHER(bill), y) }

(e) Express the following sentence as conceptual dependency structure:

“Sohan gave Tina a box of chocolate”

(f) Write the conceptual graph and FOPL representation for the following sentence:
“Every motorbike has a handle”

(g) Consider that append(L1,L2,L3) is a function in Prolog, in which list L1 is contacted with
L2 and the result is stored in L3. What would be the output of the following statement in Prolog?

?- append([2,3,4],L,[2,3,4,a,b]).

(h) Find the meaning of the statement

(~P V Q) & R → S V (~R & Q)
for the interpretation: P is true, Q is false, R is true, S is true.

(j) Transform the following sentence into disjunctive normal form:

~(P V ~Q) & (R → S)

(k) Determine whether the following sentence is satisfiable, contradictory or valid:

S : P → Q → ~P

(l) Why should the heuristic function of A* algorithm always underestimate? Give reason.
example.

(m) What is non-monotonic reasoning? Give an example.

(n) Prove that if A and B are independent events, P(A|B) = P(A). (Note that A and B are
independent if and only if P(A & B) = P(A)P(B)).

2. (a) Differentiate between partially observable and fully observable task environment of an
agent. Give an example of each.

(b) Create a frame network for terrestrial motor vehicles (cars, trucks, motorcycles) and given one
complete frame in detail for cars which includes the slots for the main component parts, their
attributes, and relations between parts.

3. (a) What is closed world assumption? Give an example.

(b) Define Modus ponens rule. Elaborate using an example.

(c) Given formula S1 and S2 below, show that Q(a) is a logical consequence of the two.
S1: (∀x)(P(x)→Q(x)) and S2: P(a)

4. (a) Create a script for shopping in a supermarket.

(b) Joint probability P(x1, x2, … , x7) by inspection as a product of chain conditional
probabilities is:
P(x1, x2, … , x7) = P(x7 | x3) . P(x6 | x5) . P(x5 | x2 x3) . P(x4 | x1 x2) . P(x3) . P(x2 | x1) . P(x1)
Draw the Bayesian belief network for the same.

5. (a) Write a program in Prolog to compute the sum of elements of a list.

(b) What are alpha and beta cutoffs? How alpha-beta pruning is used to improve the efficiency of
Minimax procedure?

6. (a) Compare and contrast Best-first search and Hill Climbing search. You can use example.

(b) What is a Recursive Transition Network (RTN)? Give an example.

(c) Give two limitations of propositional logic.

7. (a) Consider the following axioms:

January
Clouds
Cold & Precipitation → Snow
January → Cold
Clouds → Precipitation
Convert them into clausal form and prove the truth of “Snow” using Resolution

(b) Develop a parse tree for the sentence “The cruel man locked the dog in the house” using the
following rules.
S → NP VP
NP → N
NP → DET N
VP → V NP
VP → V PP
VP → V NP PP
PP → PREP NP
DET → ART ADJ
DET → ART
N → man | dog | house
V → locked
ART → the | a
ADJ → cruel
PREP → in
8. (a) Solve the following crypt arithmetic problem using constraint satisfaction.

ODD
+ ODD
------------
EVEN

(b). Describe the limitations of Hill Climbing Methods

(c). Define the PEAS for vacuum cleaner agent

Q. 9 (a) What do you understand by the term “rational agent”?

(b) What would be output of following statement in Prolog and why?

?- A is 6+3, B= 5+4, A=B

(c) Construct the truth table for the expression ( A & (A ∨ B)). What single term is the expression
equal to?

(d) Write the joint distribution of x1, x2, x3, x4, x5 and x6 as a product of chain conditional
probabilities for the following network.

(e) Develop a parse tree for the sentence 'raja slept on the sofa'.

(f) Compare and contrast depth first search and breadth first search?

(g) Transform the following sentence into Conjunctive Normal Form (CNF)

(h) Express the sentences given below into the conceptual dependency structure
(i) Ram drove the car fast
(ii) Rita gave Sita a bunch of flowers

(i) Give properties of Type 1 and Type 2 grammers from Chomsky Hierarchy of grammers.

(j) In the following two-ply game tree, the terminal nodes show the utility values computed by utility
function. Use the Minimax algorithm to compute the utility values for other nodes in the given game
tree.

(k) Write about the limitations of Hill Climbing search?

Q. 10 (a) Describe the water-jug problem. Also give a suitable state space representation for this
problem?

(b) Transform the following into clausal form:

Q. 11 (a) Write a Prolog program maxlist (L, Max) to find greatest number Max in the list L.

(b) Find the probability of the event A when it is known that some event B already occurred. From
experiments, it has been determined that P(B|A) = 084., P(A) = 0.2 and P(B) = 0.34.

Q12. (a) Determine whether the following sentence is satisfiable, contradictory or valid:
S: (P∨ Q) → (P & Q)

(b) Find whether the following sets are unifiable or not? If they are unifiable, find most general unifier
(m. g. u) otherwise give justification why they are not unifiable.
(i) {S(x, Ram), S(y, Sita)}

(ii) {P(x,y), P(f(x), z), P(z,x)}

(c) Give PEAS description for Taxi Driver Agent?

Q.13 a) When do we say that the search is admissible? You can take the example of A*.

b) What is a horn clause? Given an example.

c) Solve the following cryptarithmetic problem using Constraint Satisfaction Algorithm:

TWO
+TWO
FOUR

Q.14 a) What is a Truth Maintenance System (TMS)? Give the architecture of a problem solver with a
TMS in the form of a diagram.

b) Express the following concepts as an associative network structure with interconnected nodes and
labeled arcs. Company ABC is a software deve1opment company. Three departments within the
company are Sales, Administration and Programming. Joe is the manager of programming, Bill and
Sue are the programmers. Sue is married to Sam. Sam is .an editor for the Prentice Hall. They have
three children and they live on Elm Street. Sue wears glasses and five feet four inches tall.

Q.15 a) What is default reasoning?

b) Given the following information for a database:

A1. If x is on top o f y, y supports x.
A2. If x 1s above y and they are touching each other, x is on top of y.
A3. A cup is above a book.
A4. A cup is touching a book.

(i) Translate the statements A1 through A4 into clausal form.

(ii) Show that the predicate supports (book, cup) is true using resolution.

Q16 a) Draw the block diagram of learning agent and explain its working.