Assigned:
Monday, March 24, 2003
Due:
Monday, March 31, 2003, in the beginning of class
1. Resolution Theorem Proving
(25 points)
Consider the following information:
- Animals can outrun any animals that they can eat.
- Carnivores eat other animals.
- Outrunning is transitive: if x can outrun y and y can outrun z, then
x can outrun z.
- Lions eat zebras.
- Zebras can outrun dogs.
- Dogs are carnivores.
Use resolution theorem proving to find three animals that lions can outrun.
2. First order logic
(25 points)
Represent the following sentences in first-order logic using a consistent
vocabulary (which you must define):
- Not all students take both History and Biology.
- Only one student failed History.
- Only one student failed both History and Biology.
- The best score in History was better than the best score in Biology.
- Every person who dislikes all vegeterians is smart.
- No person likes a smart vegeterian.
- There is a woman who likes all men who are vegeterians.
- There is a barber who shaves all men in town who do not shave
themselves.
- No person likes a professor unless the professor is smart.
- Politicians can fool some of the people all of the time, and they
can fool all of the people some of the time, but they can't fool all of
the people all of the time.
3. Problem 9.4 from the textbook, pg 316
(25 points)
4. Unification
(25 points)
What is the most general unifier for the expressions, where letters
early in the alphabet are object constants, and letters late in the
alphabet are variables.
p= f(x1, g(x2, x3), x2, b) and q = f(g(h(a, x5), x2), x1, h(a, x4), x4)
p = j(f(x, g(x,y)), h(z,y)) and q = j(z, h(f(u,v), f(a,b)))
Switch to:
vasilis@cis.temple.edu