CSCE 496H/896 AI and Applications
Midterm
Examination 2
October 30, 2008
Name:
NUID:
This midterm exam consists of 4 questions and you
have 75 minutes to complete the test.
Please read every question carefully. If you have questions, please raise your hand
and I will come to you.
As part of the requirements of this exam, you must
personally pick up the exam after meeting with me in my office for the exam
score to be counted.
1. (25 points) Logic
(a) (10 points)
Use resolution to prove that R
is true, given the axioms P, T,
, and
. Show all steps
clearly.
(b) (15 points) Use resolution to prove that
, given the following (Clearly
show all instantiations, unifications, and skolemizations,
and all other steps):
· ![]()
· ![]()
· ![]()
· ![]()
· ![]()
· ![]()
· ![]()
· ![]()
2. (25 points) Knowledge Representation
(a) (10 points) Describe the Frame problem, the
Qualification Problem, and the Ramification problem
(b) (7 points) In situation calculus, we use
successor-state axioms to help address the representational frame problem. Provide one example of such axioms and
show/describe how it helps address the problem.
(c) (8 points) In situation calculus, we use fluent
axioms to help address the inferential frame problem. Provide one example of such axioms and show/describe
how it helps address the problem.
3.
(25 points) Planning
(a)
(10
points) How is partial-order planning
better than total-order planning?
Discuss using an example problem.
(b)
(10
points) Describe the four key components
of a partial-order plan.
(c)
(5
points) Describe one approach for
finding an admissible heuristic for searching for plans.
4.
(25 points) Learning
(a)
(5 points) Describe learning from examples
(aka instance-based learning or induction).
(b)
(5
points) Describe reinforcement learning.
(c)
(15
points) Identify a possible learning
problem related to your final project. Why
is it an important problem? Identify the
learning approach most appropriate to solve the learning problem. Justify your choice.