In: Computer Science
Q1) Given the following sentences:
Part 1:
Part 2:
PART 1;
¬ HOUND(x) ∨ HOWL(x)
∀ x ∀ y (HAVE (x,y) ∧ CAT (y) &rarr ∀ z ¬ (HAVE(x,z) ∧ MOUSE (z)))
∀ x ∀ y ∀ z (¬ (HAVE (x,y) ∧ CAT (y)) ∨ ¬ (HAVE(x,z) ∧ MOUSE (z)))
¬ HAVE(x,y) ∨ ¬ CAT(y) ∨ ¬ HAVE(x,z) ∨ ¬ MOUSE(z)
∀ x (LS(x) → ∀ y ¬ (HAVE (x,y) ∧ HOWL(y)))
∀ x ∀ y (LS(x) → ¬ HAVE(x,y) ∨ ¬ HOWL(y))
∀ x ∀ y (¬ LS(x) ∨ ¬ HAVE(x,y) ∨ ¬ HOWL(y))
¬ LS(x) ∨ ¬ HAVE(x,y) ∨ ¬ HOWL(y)
HAVE(John,a) ∧ (CAT(a) ∨ HOUND(a))
¬ [¬ LS (John) ∨ ¬ ∃ z (HAVE (John, z) ∧ MOUSE(z))]
LS(John) ∧ ∃ z (HAVE(John, z) ∧ MOUSE(z)))
LS(John) ∧ HAVE(John,b) ∧ MOUSE(b)
The set of CNF clauses for this problem is thus as follows: