On blank nodes

Authors:
Alejandro Mallea;Marcelo Arenas;Aidan Hogan;Axel Polleres
Affiliations:
Department of Computer Science, Pontificia Universidad Católica de Chile, Chile;Department of Computer Science, Pontificia Universidad Católica de Chile, Chile;Digital Enterprise Research Institute, National University of Ireland Galway, Ireland;Digital Enterprise Research Institute, National University of Ireland Galway, Ireland and Siemens AG Österreich, Vienna, Austria
Venue:
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Year:
2011

Citing 9
Cited 8

Worst-case Analysis of Set Union Algorithms

Journal of the ACM (JACM)
On Herbrand's Theorem

LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Description logic programs: combining logic programs with description logic

WWW '03 Proceedings of the 12th international conference on World Wide Web
A complete anytime algorithm for treewidth

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Foundations of semantic web databases

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Simple and Efficient Minimal RDFS

Web Semantics: Science, Services and Agents on the World Wide Web
Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary

Web Semantics: Science, Services and Agents on the World Wide Web
dRDF: entailment for domain-restricted RDF

ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Linked Data

Linked Data

Synchronizing semantic stores with commutative replicated data types

Proceedings of the 21st international conference companion on World Wide Web
An empirical survey of Linked Data conformance

Web Semantics: Science, Services and Agents on the World Wide Web
Blank node matching and RDF/S comparison functions

ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Querying Semantic Data on the Web?

ACM SIGMOD Record
Static analysis and optimization of semantic web queries

ACM Transactions on Database Systems (TODS) - Invited papers issue
RDFS and OWL reasoning for linked data

RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Live linked data: synchronising semantic stores with commutative replicated data types

International Journal of Metadata, Semantics and Ontologies
Don't like RDF reification?: making statements about statements using singleton property

Proceedings of the 23rd international conference on World wide web

Quantified Score

Hi-index	0.00

Visualization

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 RDFrelated 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.