| Computer Science 242Homework BSuggested review problems - not collected.
  AIMA Chapter 6
    
  AIMA Chapter 7
      Ex 7.4, 7.6, 7.7, 7.9, 7.18
      Convert the following sentences of propositional logic to conjunctive normal
form (CNF). Your answer should be a set of clauses of the form [X, Y ], [Z, ¬X, Y ], . . ..
 P ⇒ Q.
 (¬P ∧ Q) ∨ R
 W ⇒ (P ∧ Q)
 (P ∨ Q) ⇒ (R ⇒ (S ∧ V ))
	
AIMA Chapter 8
    
  AIMA Chapter 9
    
      Ex 9.3, 9.4, 9.25, 9.26
      Convert the following sentences to first-order conjunctive normal
	form (CNF).
	
	  ∀x ∃y Boy(x) ∧ Girl(y) ⇒ Likes(x,y)
	  ∃y ∀x Boy(x) ∧ Girl(y) ⇒ Likes(x,y)
	  ∃x ∀y ¬ P(x,y)
	  ∃x ¬ ∀y P(x,y)
	  ¬ ∃x ∀y P(x,y)
	  ∀x ∃y ¬ P(x,y)
	  ∀x ¬ ∃y P(x,y)
	  ¬ ∀x ∃y P(x,y)
	 |