> > Unification uses a sequence of variable->subexpression > substitutions to > > make two expressions the same, and is based entirely on the > form of the > > expressions concerned. > > I think we just look to the same thing from different perspectives. > Suppose we have the facts >[snipped] Looks a lot like prolog proof trees... -Bill ----- Bill de hÓra : InterX : bdehora@interx.comReceived on Thursday, 4 January 2001 06:22:50 GMT
This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 23 April 2007 18:19:46 GMT