- From: Pat Hayes <phayes@ihmc.us>
- Date: Mon, 13 May 2013 03:55:11 -0500
- To: W3C RDF WG <public-rdf-wg@w3.org>
I just pushed a new draft of the Semantics document, which has been cleaned up a little more (references and internal vocabulary links still need work) and is now pretty much in final form as far as content is concerned, I hope. One potentially significant change is that the definition of entailment by a set of graphs has been modified (section 5): ... a set S of graphs simply entails E when the union of S simply entails E This builds in union as the true 'conjunction' operation in RDF, treats shared bnodes properly, and I think corresponds exactly to how graphs and graph fragments are treated in practice. See section 5, text starting with "When forming the union of graphs, care must be taken..." for more exposition and how merging is distinguished from union. I have abandoned the idea of writing a model theory tutorial in an appendix, but I have included brief proofs for the "lemmas" in the normative text. If the WG feels that these are best omitted, I am happy to go along with that decision. I think they give a good "feel" for how model theory works, myself. Does anyone know how to include references while using ReSpec, when they aren't in the biblio file? Pat PS. Right now, the document does not mention datastores at all. It probably should, if only to say that yes, they have no semantics. ------------------------------------------------------------ IHMC (850)434 8903 or (650)494 3973 40 South Alcaniz St. (850)202 4416 office Pensacola (850)202 4440 fax FL 32502 (850)291 0667 mobile phayesAT-SIGNihmc.us http://www.ihmc.us/users/phayes
Received on Monday, 13 May 2013 08:55:37 UTC