Article View: comp.lang.prolog
Article #3427Unification Algorithm
From: Ling Kan
Date: Wed, 15 Jun 1988 15:43
Date: Wed, 15 Jun 1988 15:43
17 lines
1214 bytes
1214 bytes
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
Technical Details
Message-ID:
<5028@altura.srcsip.UUCP>Path:
arc1-ca.pugleaf.net!utzoo!attcan!uunet!lll-winken!lll-tis!ames!umd5!mimsy!oddjob!uwvax!umn-d-ub!umn-cs!bungia!com50!ems!srcsip!kanShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!lll-winken!lll-tis!ames!umd5!mimsy!oddjob!uwvax!umn-d-ub!umn-cs!bungia!com50!ems!srcsip!kan From: kan@srcsip.UUCP (Ling Kan) Newsgroups: comp.lang.prolog Subject: Unification Algorithm Message-ID: <5028@altura.srcsip.UUCP> Date: 15 Jun 88 15:43:25 GMT Reply-To: kan@srcsip.UUCP () Organization: Honeywell Systems & Research Center, MPLS, MN Lines: 16