W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > April to June 2005

test case for graphSolutionMapping

From: Dan Connolly <connolly@w3.org>
Date: Fri, 08 Apr 2005 14:54:27 -0500
To: RDF Data Access Working Group <public-rdf-dawg@w3.org>
Message-Id: <1112990067.15813.50.camel@localhost>

Klyne asks

Source data:

   _:a ex:p1 ex:o1 .
   _:a ex:p1 ex:o2 .

   CONSTRUCT ( ?s ex:p1 ?o )
   WHERE     { ( ?s ex:p1 ?o ) }

Result (a):
   _:a ex:p1 ex:o1 .
   _:a ex:p1 ex:o2 .
or (b):
   _:a1 ex:p1 ex:o1 .
   _:a2 ex:p1 ex:o2 .

He thinks (b) and so do I, and I think that follows from the
text, esp from the definition of RDF graph merge. Perhaps
it would be useful to be more explicit about importing the
term "merge" from rdf-mt or rdf-concepts.

In any case, let's add a test case to be sure. Steve, are you game?
Or Dave? Or perhaps I should learn to do these myself?

For reference...

Dan Connolly, W3C http://www.w3.org/People/Connolly/
D3C2 887B 0F92 6005 C541  0875 0F91 96DE 6E52 C29E
Received on Friday, 8 April 2005 19:54:30 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:00:47 UTC