kan@srcsip.UUCP (Ling Kan) (06/15/88)
In "An Efficient Unification Algorithm" by Alberto Martelli and Ugo Montanari ACM TOPLS Vol. 4, No. 2 1982, the authors described an unification algorithm that has occur check built-in and also has a better performance than Huet's and Paterson and Wegman's method. Does anyone know that if this algorithm is used in any Prolog system? Is in reality this algorithm is as good as the authors claimed? And how about the implementation cost of this method? Is there any other unification algorithm has a better performance? Thanks in advance. Ling Kan Honeywell Systems and Research Center voice: (612)782-7658 paper: 3660 Technology Dr., Minneapolis, MN 55418 UUCP: kan@srcsip.uucp bang-style: {umn-cs,ems,bthpyd}!srcsip!kan Internet: kan@src.honeywell.com