

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
Main points of this exam paper are: Researchers, Develop Schemes, Representation, Reasoning Capabilities, Commonsense, Hubert Dreyfus, Criticises, Common-Sense Knowledge, Representation Language, Criticism
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!


(NFQ Level 8)
Answer question any TWO questions (All questions carry equal marks).
Examiners: Dr. J. Buckley Mr. A. Kinsella Mr. P. Rothwell
Q1. (a) Outline the physical symbol system hypothesis. [10 marks] Briefly discuss its importance. [10 marks] (b) “Problems with logic have led AI researchers to try to develop schemes of representation, based on logic, that can capture more human commonsense reasoning capabilities.” Give and explain an example of such a problem with logic. [10 marks] (c) Hubert Dreyfus criticises attempts to represent common-sense knowledge using a formal propositional knowledge representation language. Describe and explain the argument he gives in support of his criticism. [20 marks] [Total: 50 marks]
Q2. (a) Define and explain a full state-space representation of the states and operators that you would use in attempting to solve the following problem. [16 marks]
A man has to get a fox, a chicken, and a sack of corn across a river. He has a rowboat, and it can only carry him and one other thing. If the fox and the chicken are left together, the fox will eat the chicken. If the chicken and the corn are left together, the chicken will eat the corn. How does the man do it?
(b) With the aid of pseudocode, fully explain the A* search algorithm. [18 marks] (c) Show and explain a trace the operation of the A* algorithm on the following problem: A traveller must find the shortest path from city A to city F. The following graph describes the territory. Each node is a city and each arc a road joining cities. The straight line distances are shown beside each node. Use these straight line distances as the heuristic values. The actual distances are shown (in bold) as labels on the arcs. Make sure to show how the algorithm you described in part (b) achieves the results you show in part (c).
[16 marks] [Total: 50 marks]