- From: Bill dehOra <BdehOra@interx.com>
- Date: Thu, 4 Jan 2001 11:16:30 -0000
- To: "'jos.deroo.jd@belgium.agfa.com'" <jos.deroo.jd@belgium.agfa.com>, " - *GK@Dial.pipex.com" <GK@Dial.pipex.com>
- Cc: " - *www-rdf-interest@w3.org" <www-rdf-interest@w3.org>
> > 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.com
Received on Thursday, 4 January 2001 06:22:50 UTC