Abstract
Blank nodes are defined in RDF as 'existential variables' in the same way that has been used before in mathematical logic. However, evidence suggests that actual usage of RDF does not follow this definition. In this paper we thoroughly cover the issue of blank nodes, from incomplete information in database theory, over different treatments of blank nodes across the W3C stack of RDF-related standards, to empirical analysis of RDF data publicly available on the Web. We then summarize alternative approaches to the problem, weighing up advantages and disadvantages, also discussing proposals for Skolemization. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Mallea, A., Arenas, M., Hogan, A., & Polleres, A. (2011). On blank nodes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7031 LNCS, pp. 421–437). https://doi.org/10.1007/978-3-642-25073-6_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
