Download State Space Representation - Artificial Intelligence - Past Exam and more Exams Artificial Intelligence in PDF only on Docsity!
Cork Institute of Technology
Bachelor of Science (Honours) in Software Development and Computer Networking Award (Bachelor of Science in Software Development and Computer Networking - Award) Bachelor of Science (Honours) in Software Development with a Language – Award
Bachelor of Science in Software Development with a Language – Award
(NFQ - Level 8)
Summer 2005
Artificial Intelligence
(Time: 2 Hours)
Answer question any TWO questions (All questions carry equal marks).
Examiners: Mr. P. Rothwell Dr. D. Chambers Mr. E. A. Parslow Mr. P. O’Connor
- (a) Briefly define a knowledge representation language. [3 marks]
Outline the physical symbol system hypothesis. [6 marks]
Briefly discuss its importance. [3 marks]
List and explain the four important properties of a good representational formalism. [4 marks]
(b) The Frame Problem is seen as a serious impasse for logic-based knowledge representation. Fully explain the frame problem using examples. [20 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. [14 marks]
- (a) List and explain the essentials of the state-space representation of search problems used in artificial intelligence. [12 marks]
Define the full state-space representation that you would use in attempting to solve the following “farmer, wolf, goat and cabbage problem.” (Do not bother with solving the problem) [10 marks]
A farmer, on one bank of a river has a wolf, a cabbage, and a goat and a boat. He wants to get them all across the river. The boat will take one of the wolf, cabbage, or goat with the farmer rowing. However, he can’t leave the goat with the wolf, nor the cabbage with the goat because goats eat cabbage and wolves eat goats. How an he get them across without problems?
(b) With the aid of pseudocode, fully explain the A* search algorithm. [18 marks] (c) Briefly discuss each of the following with reference to the A* algorithm: efficiency, optimality, the source of heuristics, the role of heuristics, admissible heuristics_._ [10 marks] [Total: 50 marks]
- (a) Write out and fully explain Nilsson’s algorithm for searching for optimal solution trees in AND/OR graphs. [20 marks]
(b) Show and explain a trace of the operation of Nilsson’s algorithm on the following AND/OR graph. The costs of the paths are shown below; assume all initial heuristic values h(n)=1. Make sure to show how the algorithm you described in part (a) achieves the results you show in part (b).
[30 marks]
