Question: Q 4 Unification 1 2 Points Grading comment: Compute the most general unifier ( mgu ) for each of the following pairs of atomic sentences,

Q4 Unification
12 Points
Grading comment:
Compute the most general unifier (mgu) for each of the following pairs of atomic sentences, or state that no mgu exists. (Recall that lowercase letters denote variables, and uppercase letters denote constants.)
(a) Q(y,Gee(A,B))Q(y,Gee(A,B)), Q(Gee(x,x),y)Q(Gee(x,x),y)(b) Older(Father(y),y)Older(Father(y),y), Older(Father(x),John)Older(Father(x),John)(c) Knows(Father(y),y)Knows(Father(y),y), Knows(x,x)Knows(x,x)
Note: If the mgu does not exist, write -(a dash) in the blank. This question is autograded.
Question 4.1
Q4.1
2 Points
Grading comment:
In (a), xx binds to
-
Save Answer
Question 4.1:
Last saved on Nov 08 at 3:34 PM
Question 4.2
Q4.2
2 Points
Grading comment:
In (a), yy binds to
-
Save Answer
Question 4.2:
Last saved on Nov 08 at 3:34 PM
Question 4.3
Q4.3
2 Points
Grading comment:
In (b), xx binds to
John
Save Answer
Question 4.3:
Last saved on Nov 08 at 1:22 PM
Question 4.4
Q4.4
2 Points
Grading comment:
In (b), yy binds to
John
Save Answer
Question 4.4:
Last saved on Nov 08 at 1:22 PM
Question 4.5
Q4.5
2 Points
Grading comment:
In (c), xx binds to
-
Save Answer
Question 4.5:
Last saved on Nov 08 at 3:58 PM
Question 4.6
Q4.6
2 Points
Grading comment:
In (c), yy binds to

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 Programming Questions!