Finding a Most-General Unifier

1. Given literals L1 and L2, place a cursor at the left end of each. Skip any negation sign. If the predicate symbols do not match, return NOT-UNIFIABLE.

2. Let S = { }.

3. Move the cursors right to the next term in each literal. If there are no terms left, return S as a MGU. Let t1 and t2 be the terms.

Previous slide

Next slide

Back to first slide

View graphic version