Notation3

Notation3, or N3 as it is more commonly known, is a shorthand non-XML serialization of Resource Description Framework models, designed with human-readability in mind: N3 is much more compact and readable than XML RDF notation. The format is being developed by Tim Berners-Lee and others from the Semantic Web community. A formalization of the logic underlying N3 was published by Berners-Lee and others in 2008.[1]

Notation3
Filename extension
.n3
Internet media type
text/n3;charset=utf-8
Developed byTim Berners-Lee
Type of formatsemantic web
Container forRDF data
Standardn3
Websitewww.w3.org/TeamSubmission/n3/

N3 has several features that go beyond a serialization for RDF models, such as support for RDF-based rules. Turtle is a simplified, RDF-only subset of N3.

Examples

The following is an RDF model in standard XML notation:

<rdf:RDF
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
  <rdf:Description rdf:about="http://en.wikipedia.org/wiki/Tony_Benn">
    <dc:title>Tony Benn</dc:title>
    <dc:publisher>Wikipedia</dc:publisher>
  </rdf:Description>
</rdf:RDF>

may be written in Notation3 like this:

 @prefix dc: <http://purl.org/dc/elements/1.1/>.
 
 <http://en.wikipedia.org/wiki/Tony_Benn>
   dc:title "Tony Benn";
   dc:publisher "Wikipedia".

This N3 code above would also be in valid Turtle syntax.

Comparison of Notation3, Turtle, and N-Triples

FeatureNotation3TurtleN-Triples
Character encoding UTF-8ASCII
Directives @base
@forAll
@forSome
@keywords
@prefix
Lists
() (DAML lists)
<nowiki>{ … }</nowiki> (statement lists)
Literals true / false
(Boolean)
xsd:decimal
(decimal arbitrary length)
xsd:double
(decimal double)
xsd:integer
(decimal integer)
Syntactic sugar RDF paths
QNames
a/@a (equiv. to rdf:type)
[] (shorthand for blank node)
<nowiki>=</nowiki>> (x implies y)
<<nowiki>=</nowiki> (y implies x)
<nowiki>=</nowiki> (x is equivalent to y)
, (repeat object in list)
; (repeat subject/verb in list)
gollark: Also notable is that apparently floating point inaccuracies in the neural network make the hashes turn out differently on different devices. Yet the cryptographic system doing the matches is only able to do *exact* matches, not hamming distance or something.
gollark: That wouldn't stop this sort of attack from working.
gollark: There are other possible uses, though. Someone with illegal material could just set the hash to some random value without making the image look particularly weird.
gollark: Maybe something something adverserial image scaling, if it's implemented poorly.
gollark: It's probably harder to break without the image looking noticeably different, though, since it just works by downscaling and grayscaling things or something.

See also

References

  1. Berners-Lee, T. I. M.; Connolly, D. A. N.; Kagal, L.; Scharf, Y.; Hendler, J. I. M. (2008). "N3Logic: A logical framework for the World Wide Web". Theory and Practice of Logic Programming. 8 (3). arXiv:0711.1533. doi:10.1017/S1471068407003213.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.