- From: Seth Russell <seth@robustai.net>
- Date: Wed, 03 Jan 2001 10:28:41 -0800
- To: Bill dehOra <BdehOra@interx.com>
- CC: Dan Brickley <Daniel.Brickley@bristol.ac.uk>, David Megginson <david@megginson.com>, xml-dev <xml-dev@lists.xml.org>, www-rdf-interest <www-rdf-interest@w3.org>
Corrected rule:
If [nodeX, propertyY, nodeZ] and;
[nodeY, propertyY, nodeZ] and;
[nodeX, rdf:type, nodeZ] and;
[nodeY, rdf:type, nodeZ] and;
[propertyY, atMostOneEntityValue, "yes"];
then attemptSmush (nodeX, nodeY).
Bill dehOra wrote:
> Isn't 'smushing' just unification hacking; am I missing something?
I'm not familiar with "unification hacking" but "smushing" is probably
more commonly called "aggregation". To my knowledge the term was
first used by Dan Brickley as follows:
see:
http://lists.w3.org/Archives/Public/www-rdf-interest/2000Dec/0191.html
(2) 2nd pass node convergence ("data smushing")
As discussed above, strategies that merge together RDF from
multiple
sources in such a way as to figure out (in some cases) where
anonymously-mentioned resources are descriptions of the same
thing.
Two nodes need to be smushed iff they represent the same thing.
I started a thread in news://comp.ai.fuzzy about this cause I think we
need fuzzy logic to tackle the problem watch it at
http://x72.deja.com/viewthread.xp?AN=710535725&search=thread
Seth Russell
Received on Wednesday, 3 January 2001 13:23:15 UTC