Princeton University

Computer Science 302
Introduction to Artificial Intelligence
Problem Set 3

Fall 2001
Due Oct 10


  1. Let f=~(x+ ~y(~x+z)). (a) Write out the truth table for f. (b) Convert the truth table to CNF. (c) Show the series of steps DPLL makes while solving the resulting formula. Assume variables chosen for splitting in the order x, y, z.
  2. Using the same f from the first part, follow the 3-CNF conversion algorithm to create an equivalent 3-CNF formula.
  3. Describe how to encode n-queens as a SAT problem.