Instructor: Rao Vemuri
Hand in clear, complete, concise answers to the following questions related to logic and deductive inference. Type your answers if at all possible. As usual you can discuss general issues with other students, the TAs, and the instructor, but you must otherwise do your own work. Be sure that your name is at the top of the first page, and all pages are stapled together. Each question should begin at the top of a new page. There is no programming associated with this assignment.
a. P <-> ¬P
b. P -> (Q -> P)
c. ((P ^ Q) -> R) -> (Q -> (P -> R))
d. ((P -> Q) ^ ¬P) -> ¬Q)
Abduction is an inference rule that infers P from P -> Q and Q.
a. Prove whether or not abduction is a sound rule of inference for Propositional Logic.
b. Prove whether or not abduction is a complete rule of inference for Propositional Logic.
Problem 7.2, parts (a), (b), (g), and Problem 7.5 in the textbook. Use only the predicates Student(x), Takes(x,y) meaning student x takes course y, Fails(x,y) meaning student x fails course y, Vegetarian(x), Likes(x,y) meaning person x likes person y, Woman(x), Man(x), German(x), Language(x), and Speaks(x,l) meaning person x speaks language l. You may also use the equality predicate, = (see page 193). You may not use the uniqueness quantifier, E! (see page 196).
For each of the following pairs of atomic sentences, give the most general unifier, if it exists. If none exists, explain why. w, x, y and z are variable symbols, A and B are constant symbols, F and G are function symbols, and P is a predicate symbol.
a. P(y, y) and P(A, B)
b. P(x, x) and P(A, y)
c. P(G(w), w, y) and P(z, F(A), F(B))
d. P(w, G(y), w) and P(x, x, G(A))
The Oxford don Charles Dodgson (aka Lewis Carroll) is famous not only for his novel Alice in Wonderland but also for his textbook Symbolic Logic. Here is one of the problems from that book. Consider the following premises:
1. Colored flowers are always scented.
2. I dislike flowers that are not grown in the open air.
3. No flowers grown in the open air are colorless.
and the query:
4. Do I dislike all flowers that are not scented?
a. Write a set of wffs in FOL representing the four English sentences above. Use the predicates C(x) meaning x is colored, D(x) meaning I dislike x, G(x) meaning x is grown in the open air, and S(x) meaning x is scented.
b. Convert your sentences in (a) into Conjunction Normal Form (CNF).
c. Use the Resolution Refutation method to prove the query is true given the three premises. Your proof should look like the ones in Figures 9.6 and 9.7 in the textbook. Be sure to include the most general unifiers used at each step as shown in these examples.
Department of Computer Science
University of California at Davis
Davis, CA 95616-8562
Page last modified on 1/20/2003