W3C home > Mailing lists > Public > semantic-web@w3.org > July 2007

Re: Named Graph Serialisation

From: Tim Berners-Lee <timbl@w3.org>
Date: Fri, 27 Jul 2007 11:15:04 -0400
Message-Id: <B2175456-C32D-4CCC-92D1-2994B12F75C4@w3.org>
Cc: <semantic-web@w3.org>
To: "Chris Bizer" <chris@bizer.de>



Chris,

I would really like to be able to parse Trix as N3.  It is so close!
why not use a subset of N3?

Instead of
:G2 { :Monica rdf:type ex:Person .
       :Monica ex:hasSkill ex:Programming }

why not use

:G2 trix:graph { :Monica rdf:type ex:Person .
       :Monica ex:hasSkill ex:Programming }.

which is N3.  There are subsets of N3 for NTriple, N3 rules, N3/rdf,  
Turtle, N3/query, and so on.
A subset which is used for just expressing the contents of graphs  
would be easy to define.

If the predicate trix:graph actually refers to a graph one would  
expect to get by dereferencing the document G2, then log:semantics  
could  be  used.   (I have wondered about adding shortcut  like :-  
or   @= for log:semantics as it crops up so often.)

If on the other hand the semantics is that G2 is the graph (not the  
document), the owl:sameAs could be used, where the shortcut is = so  
you would get

:G2 = { :Monica rdf:type ex:Person .
       :Monica ex:hasSkill ex:Programming }.

Making the predicate optional, and omitting the final "." messes up  
the compatibility.  Two small changes!  Thank you for making the rest  
compatible as it is.

Tim
Received on Friday, 27 July 2007 15:15:10 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 1 March 2016 07:41:58 UTC