Question

For each pair of atomic sentences, give the most general unifier if it exists. You must show each step clearly – each substitution is a separated step.

          a.   P(x, f(w), Bill), P(g(z), u, w)

          b.  Q(Red,x,y), Q(x,y,z)

Answer 1

a. Most General Unifier(mgu) :   { g(z) | x , f(w) | u , Bill | w }  

b. Unification not possible , hence most general unifier does not exist

For stepwise substitutions refer to the attached image--