From RDF Working Group Wiki
Jump to: navigation, search

Workshop results

Suggestions called "Graph Identification" from Stanford Workshop are reproduced below.

  • widely used by the community
  • part of SPARQL already
  • numerous use cases
  • clarify confusion in implementation
  • adds complication and may not solve the issue nevertheless
  • complicates the RDF model (potentially)
  • risks with backward compatibility should be assessed (e.g., syntax)
  • does it need standardization?
Technical Issues
  • mutual roles of quads vs. singleton named graphs vs. named graphs
  • extension the RDF(S) semantics?
  • new RDF(S) terms? rdf:Graph, rdf:subGraphOf, rdf:equivalentGraph, etc.
  • syntax (TRIG, INRIA Member submission, Web, Graphs and Semantics , n3)
  • graph inclusion, can named graphs share triples
  • whether blank nodes can be shared among multiple graphs
  • whether blank nodes can be used as graph names
  • named graphs do not fully replace reification
  • how would follow your nose apply to named graphs?
  • relationships to SPARQL
  • effects on the SW stack
  • how does it influence the OWL semantics?