CS561 Artificial Intelligence
Quiz 5b
Thursday, March 6, 2014
Name:
Student ID:
Student email:
Tony, Claude and Ellen belong to the Zymba Club. Every member of the Zymba Club is either a
skier or a mountain climber or both. No mountain climber likes rain, and all skiers like snow.
Ellen dislikes whatever Tony likes and likes whatever Tony dislikes. Tony likes rain and snow.
We want to answer the following query:
● Is there a member of the Zymba Club who is a mountain climber but not a skier?
The problem has been converted into the following CNF sentences:
1. Skier(x1) v MountainClimber(x1)
2. ~MountainClimber(x2) v ~Likes(x2, Rain)
3. ~Skier(x3) v L(x3, Snow)
4. ~Likes(Tony, x4) v ~Likes(Ellen, x4)
5. Likes(Tony, x5) v Likes(Ellen, x5)
6. Likes(Tony, Rain)
7. Likes(Tony, Snow)
8. Negation of the Query: ~M(x7) v S(x7)
1. [10pts] To answer the query use resolution to prove by contradiction.
Include the � for each unification.