Question: (65marks] 4. Using the algorithm(s) of your choice check whether the following pairs of literals are unifiable or not. For those pairs that are unifiable,

 (65marks] 4. Using the algorithm(s) of your choice check whether the

(65marks] 4. Using the algorithm(s) of your choice check whether the following pairs of literals are unifiable or not. For those pairs that are unifiable, find the most general unifier. (a) P(x, g(f(z,a))) and P(f(y.g(y)). g(y)). (b) Q(r, y. g(u), g(x)) and Q(f (y), f (=), 2, u)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!