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](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/10/6703f945054e0_6686703f944e882b.jpg)
(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
Get step-by-step solutions from verified subject matter experts
