W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > October to December 2004

"entails" clearer than "subgraph" in defn Graph Pattern Match

From: Dan Connolly <connolly@w3.org>
Date: Sat, 20 Nov 2004 17:28:28 -0600
To: RDF Data Access Working Group <public-rdf-dawg@w3.org>
Message-Id: <1100993309.27188.37.camel@dirk>
I'm going over the definitions, and in the case of...

"Graph Pattern GP matches RDF graph G with substitution S if S(GP) is a
subgraph of G."

I think entails is clearer:

"Graph Pattern GP matches RDF graph G with substitution S if G
simply entails S(GP)."

with simply entails linked to
 http://www.w3.org/TR/rdf-mt/#defentail


p.s. a public comment asked
"which definition of subgraph does SPARQL use - the standard one from
graph
theory or the expansive one used in RDF semantics in the presence of bnode
relabelling?"
http://lists.w3.org/Archives/Public/public-rdf-dawg-comments/2004Oct/0003.html

it's the one with relabelling. So subgraph is perhaps misleading.

-- 
Dan Connolly, W3C http://www.w3.org/People/Connolly/
D3C2 887B 0F92 6005 C541  0875 0F91 96DE 6E52 C29E

Received on Saturday, 20 November 2004 23:27:47 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 16:15:21 GMT