UNIVERSITY EXAMINATIONS

ARTIFICIAL INTELLIGENCE
ASSIGNMENT 2 / CAT 2

DUE DATE: Thursday 1st December 2022 at 10am

INSTRUCTIONS:
Answer ALL questions.

Question 1
Represent the following as a set of frames:
The aorta is a particular kind of artery, which has a diameter of 2.5cm. An artery is a kind of
blood vessel. An artery always has a muscular wall, and generally has a diameter of 0.4cm.
A vein is a kind of blood vessel, but has a fibrous wall. Blood vessels all have tubular form
and contain blood. (6marks)

Question 2
"Musa is a small hippopotamus who lives in Nairobi National Park. Like all
hippopotamuses he eats grass and likes swimming'' .
(a) Represent the above:
(i) as a semantic net
(ii) in predicate logic
(b) Give two new facts about Musa that are:
a) Easier to represent in a semantic net than in predicate logic.
b) Easier to represent in logic than in a semantic net.
(6 marks)

Question 3

(a) Define sentences in propositional calculus using examples.

(4 marks)
(b) What does a propositional symbol denote?
(1 mark)
(c) Show the truth value of the following propositional calculus sentences:
i. P  Q  R ; where P and R have truth value F, and Q has truth value T
ii. (P  Q)  (P  R) ; where P, Q and R have truth value T
iii. Q  R  R  Q ; where R has truth value F and Q has truth value T
(5marks)
Question 4

Many of the search methods have as their basis some aspect of the real world. Propose an
idea for a search algorithm based on some natural process or animal behaviour. Discuss how
your method could be realised in a computer implementation in solving, say, the TSP.
(10 marks)

1
Question 5

In this problem the start state is S, and the goal state is G. The transition costs are next to the
edges, and the heuristic estimate, h, of the distance from the state to the goal is in the state’s
node. Assume ties are always broken by choosing the state which comes first alphabetically.
a) Construct the loop free tree of the network above.
b) What is the order of states expanded using Depth First Search? Assume DFS
terminates as soon as it reaches the goal state.
c) What is the order of states expanded using Breadth First Search?
d) What is the order of states expanded using Best First Search? Assume BFS
terminates as soon as it reaches the goal state.
e) What is the order of states expanded using A* search?
f) What is the least cost path from S to G?
(10 marks)