CS 462  Homework #3.  Deadline: April 15, 2003

Problem 1: AIMA, page 180 / 6.3 MODIFIED -- use Wang algorithm 
to prove if a formula is valid, satisfiable or unsatisfiable. Explain
how you destinguish between a formula being satisfiable and 
unsatisfiable when using Wang algorithm.

Problem 2: AIMA, page 181 / 6.10

Problem 3: AIMA, page 182 / 6.12  Note: No code is required. Prove it
by hand and submit a step-by-step proof of the solution clearly showing
which inference rule was used at each step and what assumptions were
made.