On Blank Nodes
Lecture notes in computer sciencePublished 1 January 2011Open access
Alejandro Mallea, Marcelo Arenas, Aidan Hogan, Axel Polleres
Citations82
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper thoroughly covers the issue of blank nodes in RDF, from incomplete information in database theory, over different treatments of blank node across the W3C stack of RDFrelated standards, to empirical analysis of Rdf data publicly available on the Web.
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.
Keywords
Computer Science
International Journal on Semantic Web and Information SystemsLinked Data - The Story So Far
4,562 Citations2009Christian Bizer, Tom Heath +1 more
The authors describe progress to date in publishing Linked Data on the Web, review applications that have been developed to exploit the Web of Data, and map out a research agenda for the Linked data community as it moves forward.
Synthesis lectures on the semantic webLinked Data: Evolving the Web into a Global Data Space
1,629 Citations2011Tom Heath, Christian Bizer
This Synthesis lecture provides readers with a detailed technical introduction to Linked Data, including coverage of relevant aspects of Web architecture, as the basis for application development, research or further study.
Linked Data
1,062 Citations2011Tom Heath, Christian Bizer +1 more
SSRN Electronic JournalDescription Logic Programs: Combining Logic Programs with Description Logic
810 Citations2003Benjamin N. Grosof, Ian Horrocks +2 more
Journal of the ACMWorst-case Analysis of Set Union Algorithms
449 Citations1984Robert E. Tarjan, Jan Van Leeuwen
It is shown that two one-pass methods proposed by van Leeuwen and van der Weide are asymptotically optimal, whereas several other methods, including one proposed by Rein and advocated by Dijkstra, are slower than the best methods.
Studies in computational intelligenceRDF Support in the Virtuoso DBMS
423 Citations2009Orri Erling, Ivan Mikhailov
This paper discusses RDF related work in the context of OpenLink Virtuoso, a general purpose relational / federated database and applications platform, and discusses adapting a relational engine for native RDF support with dedicated data types, bitmap indexing and SQL optimizer techniques.
Journal of Web SemanticsCompleteness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary
317 Citations2005Herman J. ter Horst
It is proved that entailment for RDF Schema (RDFS) is decidable, NP-complete, and in P if the target graph does not contain blank nodes, and that consistency is in P.
OWL 2 Web Ontology Language
309 Citations2009Manchester Syntax, Matthew Horridge +1 more
TheManchester Syntax is used in the OWL 2 Primer, and this document provides the language used there; it is expected that tools will extend the Manchester Syntax for their own purposes, and tool builders may collaboratively extend the common language.
Foundations of semantic web databases
284 Citations2004Claudio Gutiérrez, Carlos Hurtado +1 more
This work proposes a query language with well-defined semantics and study the complexity of query processing, query containment, and simplification of answers, including computational aspects of testing entailment and redundancy.
Lecture notes in computer scienceEvolving the Web into a Global Data Space
152 Citations2011Christian Bizer
This talk will discuss how the openness and self-descriptiveness of Linked Data provide for splitting data integration costs between data publishers, data consumers and third parties and thus might enable global-scale data integration in an evolutionary, pay-as-yougo fashion.
A complete anytime algorithm for treewidth
142 Citations2004Vibhav Gogate, Rina Dechter
Lecture notes in computer scienceSigning RDF Graphs
98 Citations2003Jeremy J. Carroll
The techniques in this paper are key enablers for the use of digital signature technology in the Semantic Web.
Journal of Web SemanticsSimple and Efficient Minimal RDFS
78 Citations2009Sergio Muñoz, Jorge Eduardo Pérez Pérez +1 more
This paper introduces a small fragment which, preserving the normative semantics and the core functionalities, avoids the complexities of the original specification, and captures the main semantic functionalities of RDFS.
OWL 2 Web Ontology Language RDF-Based Semantics
67 Citations2009Jeremy J. Carroll, Iván Herman +1 more
This document defines the RDF-compatible model-theoretic semantics of OWL 2, which is an ontology language for the Semantic Web with formally defined meaning.
Lecture notes in computer scienceOn Herbrand's theorem
63 Citations1995Samuel R. Buss
A direct proof is given, based on cut-elimination, of what is essentially Herbrand's original theorem: the “nocounterexample theorems” recently used in bounded and Peano arithmetic are immediate corollaries of this form of herbrand's theorem.
Studies in computational intelligenceNetworked Knowledge - Networked Media
58 Citations2009Tassilo Pellegrini, Pellegrini, Tassilo +3 more
Defining Well-Known Uniform Resource Identifiers (URIs)
48 Citations2010M. Nottingham, Eran Hammer-Lahav
This memo defines a path prefix for "well-known locations", "/.well- known/", in selected Uniform Resource Identifier (URI) schemes.
OWL: Experiences and DirectionsLogical Reconstruction of Normative RDF.
39 Citations2005Enrico Franconi, Jos de Bruijn +1 more
It is proved that the logical framework is equivalent to the normative W3C definitions of RDF/RDFS and OWL-DL/Lite and has a unified model theoretic semantics for both worlds.
Exploiting RDFS and OWL for Integrating Heterogeneous, Large-Scale, Linked Data Corpora
34 Citations2011Aidan Hogan
This thesis designs bespoke algorithms based on the Semantic Web standards and traditional Information Retrieval techniques to help smooth out the heterogeneity of large-scale corpora of Linked Data aggregated from millions of sources on the Web in a scalable and robust manner.
Lecture notes in computer sciencedRDF: Entailment for Domain-Restricted RDF
14 Citations2008Reinhard Pichler, Axel Polleres +2 more
It is shown that the restriction of domains in dRDF raises the complexity of entailment from NP-to Π2P -completeness and it is proved that the entailment is tractable for unrestricted graphs and coNP-complete for domain-restricted graphs.
DSpace@MIT (Massachusetts Institute of Technology)Description Logic Programs: Combining Logic Programs with Description Logic
11 Citations2004Benjamin N. Grosof, Ian Horrocks +2 more