Re: problems with concise bounded descriptions

From: "Peter F. Patel-Schneider" <pfps@research.bell-labs.com>
Subject: Re: problems with concise bounded descriptions
Date: Fri, 01 Oct 2004 05:24:57 -0400 (EDT)

> From: "Eric Prud'hommeaux" <eric@w3.org>
> Subject: Re: problems with concise bounded descriptions
> Date: Thu, 30 Sep 2004 22:17:32 -0400

[...]

> > > Problem 7:  This definition does not provide enough information to
> > > distinguish the node from other distinguishable nodes in the graph.
> > > Consider, for example, the RDF graph: 
> > > 	ex:r rdf:type owl:InverseFunctionalProperty .
> > > 	_:a ex:r _:b .
> > > 	_:b ex:r _:a .
> > > 	_:a ex:s "NODE A" .
> > > 	_:b ex:s "NODE B" .
> > > Then the CBD of _:a in this graph is
> > > 	_:x1 ex:r _:x2 .
> > > 	_:x2 ex:r _:x1 .
> > > which is the same as the CBD of _:b in this graph but _:a and _:b are
> > > distinguishable in the graph and thus should have different CBDs.
> > 
> > Yeah, but nothing else sovles that either. They're ambiguous to the
> > server and they're ambiguous to the client. The only additional info
> > that the server has is that there exists in the domain of discourse
> > another bNode. I don't think it's worth telling the client about it.
> 
> The whole point in this example is that _:a and _:b are *not*
> distinguishable to the server.  _:a is "NODE A" and _:b is "NODE B".  As
> the two nodes are distinguishable to the server, they should have different
> CBDs.

Arghh!  I meant:

The whole point in this example is that _:a and _:b *are* distinguishable
to the server.  _:a is "NODE A" and _:b is "NODE B".  As the two nodes are
distinguishable to the server, they should have different CBDs.

peter

Received on Friday, 1 October 2004 09:40:26 UTC