Re: RDF Graphs

Hello,

It depends what you want to do. If you want a graph based representation that will guarantee soundness and completeness wrt some sort of graph operation (homomorphism) in this case take a look at ftp://ftp.inrialpes.fr/pub/exmo/publications/baget2005a.pdf (section 4.3). The idea is that you represent each subject, object and predicate as nodes and the triple as a hyperedge. 

However, if you want a graph based representation which is intuitive for the user then maybe you do not need this kind of precision and you do not really care that your predicate is also an object. 

(Actually I would be very interested to read an article empirically demonstrating that graphs are better than other representations for explanation!)

Best,
Madalina

Le 27 oct. 2014 à 16:26, Hugh Glaser <hugh@glasers.org> a écrit :

> Everyone talks about RDF Graphs, and I have sort of puzzled over what an RDF Graph is - so I thought I would ask.
> 
> Sorry if you just need to point me at some W3C resource somewhere.
> 
> "This linking structure forms a directed, labeled graph, where the edges represent the named link between two resources, represented by the graph nodes. This graph view is the easiest possible mental model for RDF and is often used in easy-to-understand visual explanations.”
> (http://www.w3.org/RDF/ )
> (I strongly agree with the second sentence, by the way!)
> 
> Simple Graphs are usually G = (V, E) comprising a set V of vertices together with a set E of edges, but that doesn’t seem to describe RDF Graphs for me.
> 
> The sort of thing that I am considering is an RDF Graph such as:
> 
> rdfs:label rdfs:label “Label” .
> 
> Is it G = ({rdfs:label, “Label”}, {(rdfs:label, “Label”)} with edge-labelling function (rdfs:label, “Label”) => rdfs:label ?
> So we need to have both a vertex and an edge label with value rdfs:label, and they don’t really have a logical connection.
> Sort of worrying?
> 
> Is that the sort of graph an RDF Graph is, and is that how it is formally defined?
> 
> Also, a "labeled graph” usually refers to the vertices being labelled; should it not say that RDF is a “directed, edge-labelled graph”?
> 
> Not exactly my forte this, so I am hoping I will be able to understand any answers!
> Best
> Hugh
> -- 
> Hugh Glaser
>   20 Portchester Rise
>   Eastleigh
>   SO50 4QS
> Mobile: +44 75 9533 4155, Home: +44 23 8061 5652
> 
> 
>

Received on Wednesday, 29 October 2014 21:07:27 UTC