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

Re: puzzled by Pattern Solution 2nd sentence

From: Seaborne, Andy <andy.seaborne@hp.com>
Date: Wed, 24 Nov 2004 15:40:33 +0000
Message-ID: <41A4AB71.1010105@hp.com>
To: Dan Connolly <connolly@w3.org>
Cc: RDF Data Access Working Group <public-rdf-dawg@w3.org>

Dan Connolly wrote:
> "Definition: Pattern Solution
> A Pattern Solution of Graph Pattern GP on graph G is any substitution S
> such that GP matches G with S.
> For a graph pattern GP formed as a set of triple patterns, S(G), has no
> variables and is a subgraph of G."
> The first sentence is fine (I've transcribed it in MathML and
> converted it via XSLT to N3). I can't make out the 2nd
> sentence, though. Help?

The 2nd sentence was supposed to be helpful explanation :-) to say what's going 
on to people more interested in the fact that "match" means no variables left 
and the substituted pattern is part of the data graph.  Guess it failed.

Received on Wednesday, 24 November 2004 15:40:47 UTC

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