Consider the following expression: (A(x) B(x)) (A(x) B(John)) A(Tom) This expression is in
Question:
Consider the following expression:
(A(x) ∨ B(x)) ∧ (A(x) ∨ ¬B(John)) ∧ ¬A(Tom)
This expression is in conjunctive normal form, and the variable x is universally quantified.
Use unification to show that the expression always evaluates to False.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Question Posted: