> I'm just curious, but is there a difference between the Martinelli and
> Montanari unification algorithm and the unification algorithm seen
> in Prolog?
In short, the Martelli/Montanari algorithm includes the occurs check and always
runs in linear time. The vanilla unification algorithm used in many Prolog
systems omits the occurs check, which makes it faster when processing most
terms (those on which it, too, can run in linear time), but it can take
exponential running time in some situations.
Greetings,
Jens.
--
Internet: jensk@hpbeo82.bbn.hp.com HPDESK : JENS_KILIAN%XU@HP1200
MausNet: Jens Kilian @ BB KILIAN_JENS/HP1200_XU@hpbbi4
-------------------------------------------------------------------------------
As the air to a bird, or the sea to a fish, so is contempt to the contemptible.
|