Index: Overview.html
===================================================================
RCS file: /w3ccvs/WWW/2001/sw/DataAccess/rq23/Overview.html,v
retrieving revision 1.612
retrieving revision 1.613
diff -u -u -r1.612 -r1.613
--- Overview.html	21 Jan 2006 21:16:08 -0000	1.612
+++ Overview.html	23 Jan 2006 13:13:08 -0000	1.613
@@ -4,7 +4,7 @@
 
 <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
 <head>
-  <meta name="RCS-Id" content="$Id: Overview.html,v 1.612 2006/01/21 21:16:08 aseaborne Exp $" />
+  <meta name="RCS-Id" content="$Id: Overview.html,v 1.613 2006/01/23 13:13:08 aseaborne Exp $" />
 
   <title>SPARQL Query Language for RDF</title>
 <style type="text/css">
@@ -30,8 +30,8 @@
 
       <dt>Editors working draft.</dt>
       <dd>Live Draft - version:<br />
-      <span class="cvs-id">$Revision: 1.612 $ 
-      of $Date: 2006/01/21 21:16:08 $</span></dd>
+      <span class="cvs-id">$Revision: 1.613 $ 
+      of $Date: 2006/01/23 13:13:08 $</span></dd>
 
       <!-- dt>This version:</dt>
         <dd><a href="http://www.w3.org/TR/2005/WD-rdf-sparql-query-20050419/">http://www.w3.org/TR/2005/WD-rdf-sparql-query-20050419/</a></dd>
@@ -1059,6 +1059,10 @@
   unspecified entailment to allow for future extension of the language. This 
   specification covers only <a href="http://www.w3.org/TR/rdf-mt/#entail">simple 
   entailment</a> <a href="#RDF-MT">[RDF-MT]</a>.</p>
+  <p class="todo">@@ Outstanding:replace the scoping set with a statement that G 
+  and G' do not share bNodes; the ordered merge is graph union.&nbsp; Marked ** 
+  below.</p>
+  <p>&nbsp;</p>
   
   
   <div class="defn">
@@ -1090,6 +1094,7 @@
         <li>blank node names</li>
       </ul>
       <p class="todo">(@@ ed: which is all URIs and bNodes)</p>
+      <p class="todo">@@**</p>
   </div>
   
   <div class="defn">
@@ -1130,14 +1135,20 @@
   scoping set B includes only the RDF terms in G. </p>
   <p class="todo">@@** interaction in the last sentence.</p>
   <p>When using simple entailment, 
-  the operation of querying an RDF graph provides access to the graph structure.</p>
+  the operation of querying an RDF graph provides access to the graph structure; 
+  nothing that is not already in the graph G needs to be inferred or 
+  constructed, even implicitly. If the scoping graph G' is such that it does not share blank nodes with 
+  basic graph pattern, 
+  then the above definition can be simplified to use a graph union instead of an 
+  ordered merge.</p>
   
   <p>In the case of simple entailment, a pattern solution can be defined as 
-  follows:To match a basic graph pattern under simple entailment, it is possible to 
+  follows: to match a basic graph pattern under simple entailment, it is possible to 
   proceed by finding a mapping from blank nodes and variables in the basic graph 
   pattern to terms in the graph being matched; a pattern solution is then a mapping restricted to just 
-  the variables. Moreover, the uniqueness property of pattern solutions guarantees the interoperability between SPARQL systems: given a graph and a basic  
-graph pattern, the set of all the pattern solutions is unique.</p>
+  the variables. Moreover, the uniqueness property of pattern solutions guarantees the
+  interoperability between SPARQL systems: given a graph and a basic  
+  graph pattern, the set of all the pattern solutions is unique.</p>
   <p>As an example of a Basic Graph Pattern:</p>
   <p>Data:</p>
 
@@ -6385,6 +6396,9 @@
   <pre>
  <!-- log starts on next line, not this one -->
 $Log: Overview.html,v $
+Revision 1.613  2006/01/23 13:13:08  aseaborne
+More drafting for BGP matching
+
 Revision 1.612  2006/01/21 21:16:08  aseaborne
 ~ Grammar change to be clearer abou tbasic graph patterns
   There are no language changes.

