Assigned: Sep. 19
Due: Sep. 26
(By all means work out this problem on this sheet, rather than recopy this tree.)
P => (Q < = > R). W^R => ~Q. X => (Q V R). P ^ ~W => X X => W. ~P => R.A. Convert the above sentences to CNF.
B. Show how the Davis-Putnam procedure finds a satisfying assignment over these sentences. In tracing the algorithm, when you come to a branch point, you should make an assignment to the lowest atom alphabetically, and attempt the assignment of TRUE before the assignment of FALSE.