The Ultimate Problem of RDF and the Semantic Web
July 19, 2011
Check out the new blog post The Ultimate Problem of RDF and the Semantic Web on milicicvuk.com/blog.
In the previous posts I’ve covered two important problems of the RDF model, related to blank nodes and literals. Here, I’m going to focus on what I think is the key problem of RDF – the problem of the node of an RDF graph.
In the RDF: Concepts and Abstract Syntax, a node is defined as follows:
“The set of nodes of an RDF graph is the set of subjects and objects of triples in the graph.”
It then states that a node can be a URI reference, a literal or a blank node. However, the concept of a node itself is not clearly defined. What is it that is common to all different types of nodes? What requirements does a node need to meet in order to be a node?
read the whole post >