


Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
This is an examination paper for the module artificial intelligence (comp9004) in the m.sc. In software development program at cork institute of technology. The paper consists of five questions, each focusing on a different topic in artificial intelligence, including game trees, production systems, genetic algorithms, non-monotonic reasoning, and knowledge representation. The paper includes instructions, requirements, and a note to candidates, as well as sample questions and problem-solving traces.
Typology: Exams
1 / 4
This page cannot be seen from the preview
Don't miss anything!



Autumn Examinations 2008/
Module Code: COMP
School: Mathematics and Computing
Programme Title: M.Sc. in Software Development
Programme Code: KSDEV_9_Y
External Examiner(s): Dr. J. Power Internal Examiner(s): Dr. J. Stynes
Instructions: Answer any four questions. Show all work.
Duration: 2 hours
Sitting: Autumn 2009
Requirements for this examination:
Note to Candidates: Please check the Programme Title and the Module Title to ensure that you have received the correct examination paper. If in doubt please contact an Invigilator.
a
Q1. (a) Apply the minimax algorithm to the following game tree in which static scores are from the maximising player’s point of view. Which move should be chosen? The algorithm can be improved by selectively pruning unpromising parts of the graph using the alpha-beta pruning technique. In this case, which nodes need not be examined in a left to right alpha- beta pruning? Which nodes need not be examined in a right to left alpha-beta pruning? (12 marks)
b c d
e f g h i j k l
m n o s t u v w x y z a1 b1 c1 d 9 8 5 5 2 3 2 2 4 3 7 8 6 7 6
p q r 11 6 9
(b) List the steps in the A* algorithm to find an optimal path in a search space. Under which circumstances may the algorithm fail to find a solution even though one exists? Illustrate with an example. (13 marks)
Q5. (a) Explain the semantic net/frame approach to knowledge representation and inference. Justify its popularity and mention any major drawbacks. (10 marks)
(b) Represent the following (i) as a semantic net; (ii) in predicate logic “Bambie is a baby elephant who lives in Fota zoo. Like all elephants, Bambie is a plant- eater and is a good swimmer. Elephants can walk and “run” but can not trot, jump nor gallop.” (10 marks)
(c) Give two new facts about Bambie that is easier to represent in a semantic net than in predicate logic. (5 marks)
Q6. In predicate logic, (a) Transform the following expression into clause form: ( ∃ x { ∀ y [ r(x,y) → q(y) ] } ) → ¬ ( ∀ x ∃ y ∃ z q(y,x) ) Why do the variables in different clauses need to be standardized? (12 marks)
(b) Formulate the following as first order predicate calculus formulas and use the method of resolution and refutation to answer the question (find all possible answers). During resolution, why is an expression involving a variable never unified with that variable? “ Tweety is a bird; Goldie is a fish; Squiggly is a worm. Birds like worms. Cats like fish. Cats like birds. My cat eats everything he likes. Determine what my cat eats.” (13 marks)