- From: <jos.deroo.jd@belgium.agfa.com>
- Date: Thu, 4 Jan 2001 15:07:41 +0100
- To: " - *BdehOra@interx.com" <BdehOra@interx.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... Exactly Bill, except that Prolog will cycle indefinitely in those horn clauses. But that does not change the fact that they are meaningful descriptions. It is up to inference engines to do something about that cycling and come up with meaningful proof values or a no-proof-found value. -- Jos
Received on Thursday, 4 January 2001 09:08:21 UTC