CS 205 Quiz #3A - Oct 4, 2012

NAME: __________________________SOLUTIONS______________________________________

RUID:___________________________________________________________________________

Electronic Devices are not permitted during the quiz. These include but are not restricted to calculators, computers and cell phones. No communication between students or anyone outside of class is permitted during the quiz. Textbooks, notes and any other written materials are not permitted during the quiz.

DO NOT OPEN UNTIL INSTRUCTED TO DO SO

All questions are 1 points per blank, except (4), which is 2 points per blank.

1. Suppose we have the following argument: h g h r ---------------------------------- r g If we wanted to use resolution refutation to determine if the argument is valid, which of the following would we want to do? Write True or False in the blank provided. ___FALSE___ a) Show that the following is satisfiable: ( (h g) (h r) ) (r g) ___FALSE___ b) Show that the following is unsatisfiable: ( (h g) (h r) ) (r g) ___FALSE___ c) Show that the following is a tautology: ( (h g) (h r) ) (r g) ___FALSE___ d) Show that the following is satisfiable: ( (h g) (h r) ) (r g) ___FALSE___ e) Show that the following is unsatisfiable: ( (h g) (h r) ) (r g) ____TRUE___ f) Show that the following is a tautology: ( (h g) (h r) ) (r g) ___FALSE___ g) Show that the following is satisfiable: ( (h g) (h r) ) (r g) ____TRUE___ h) Show that the following is unsatisfiable: ( (h g) (h r) ) (r g) ___FALSE___ i) Show that the following is a tautology: ( (h g) (h r) ) (r g)

Although it is not really what is done for resolution refutation, we will accept TRUE for (e),(g) & (i). (e) effectively answers (f) by showing the logical expression is not a tautology. (g) & (i) effectively answer (h) by showing the logical expression is not unsatisfiable. (d) does not answer (f) because it does not sufficiently answer whether the statement is a tautology.

2. Are the following in conjunctive normal form (CNF)? Write True in the blank if it is in CNF, otherwise write False.

_____FALSE___

a)

( ( a b ) ( c d ) ) e

_____FALSE___

b)

( a b ) ( c d )

_____TRUE____

c)

( a b ) ( c d )

_____FALSE___

d)

( a b ) ( c d )

_____FALSE___

e)

a b

_____FALSE___

f)

c d

_____TRUE____

g)

_____FALSE___

h)

( a b )

( c d )

_____FALSE___

i)

( a b )

( c d )

_____TRUE____

j)

a b

c d

_____TRUE____

k)

a b

c d

3. Suppose we have the following argument: a ( b c) c ( b d) b ---------------------------------- a c Which of the following is a CNF logical expression to which we could recursively resolution to determine if the argument is valid? (In other words, what would your logical expression look like right before you begin applying resolution if you were solving this problem?) Mark correct expressions with true. Mark incorrect expressions with false.

_____FALSE___ a) a b c c b d b a c

_____FALSE___ b) a b c c b d b (a c)

_____ FALSE___ c) ( a b c ) ( c b ) ( c d ) b a c

_____FALSE___ d) ( a b c ) ( c ( b d ) ) b (a c)

_____FALSE___ e) ( a b c ) ( c ( b d ) ) b (a c)

_____FALSE___ f) ( a b c ) ( c b ) ( c d ) b (a c)

_____FALSE___ g)

( a b c ) ( c b ) d b a c

_____FALSE___ h)

( a b c ) ( c b ) d b a c

_____FALSE___ i)

( a b c ) ( c b ) d b a c

(3 cont) a ( b c) c ( b d) b ---------------------------------- a c Corresponding Tautology is F (((a ( b c )) (c ( b d )) b) (a c) Inverse is

F (((a ( b c )) (c ( b d )) b) (a c) Converting to CNF: F ((a ( b c )) (c ( b d )) b) (a (a ( b c )) (c ( b d )) b) (a ( Table 7 #1 ) (a ( b c )) (c ( b d )) b) a c ( De Morgans & Double Negation ) ( (a b) (a c )) ((c b ) (c d )) ( Distributive ) (a b) (a c ) (c b ) (c d ) b ( Associative ) c) c)

b) a c a c

4. Suppose we have the following logical statement: ( a b ) ( a c ) b c Which of the following represent a correct application of iterative resolution? Mark correct with True and incorrect with False. _____TRUE___ a) 1. Resolve ( a b ) and ( a c ) on a to get ( b c ) 2. Resolve ( b c ) and b on b to get c 3. Resolve c and c on c to get an empty clause

____FALSE___ b) 1. Resolve ( a b ) and ( a c ) on a to get b c 2. Resolve b and b on b to get true 3. Resolve c and c on c to get an empty clause

____FALSE___ c) 1. Resolve ( a b ) and ( a c ) on a to get b c 2. Resolve b and b on b to get true 3. Resolve c and c on c to get true, so no empty clause exists

_____TRUE___ d) 1. Resolve ( a b ) and b on b to get a 2. Resolve a and ( a c ) on a to get c 3. Resolve c and c on c to get an empty clause

____FALSE___ e) 1. Resolve ( a b ) and b c on b to get a c 2. Resolve ( a c ) and a c on a to get c c 3. c c is false, so that is an empty clause

____FALSE___ f) 1. Resolve ( a b ) and b c on b to get a c 2. Resolve ( a c ) and a c on a to get c c 3. c c is false, so no empty clause exists

5. Suppose a = 5, B = { 5 }, C = { 1, 2, 3, 4 } and D = { 1, 2, 3, 4, 5 }. Mark each of the following statements as True, False or Undefined. (Use Undefined when the operators are not defined for the operands shown.) _____True____ a) a B False is accepted in place of Undefined ____False_____ b) a D

__Undefined__ c)

a D

__Undefined__ d)

a D

__Undefined__ e)

a = B

____False____ f)

C D = B

_____True____ g)

B = D C

_____True____ h)

( C B ) = D

_____True____ i)

a ( C D )

____False_____ j)

B ( D C )

____False_____ k)

B ( C D ) =

_____True____ l)