In this paper a novel approach is presented for generating RDF graphs of arbitrary complexity from various spreadsheet layouts. Currently, none of the available spreadsheet-to-RDF ...
In this sketchy paper we introduce a logical reconstruction of the RDF family of languages and the OWL-DL family of languages. We prove that our logical framework is equivalent to ...
The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important...
Starting from the general framework for Annotated RDFS which we presented in previous work (extending Udrea et al's Annotated RDF), we address the development of a query langu...
Nuno Lopes 0002, Axel Polleres, Umberto Straccia, ...
The Semantic Web is based on accessing and reusing RDF data from many different sources, which one may assign different levels of authority and credibility. Existing Semantic Web ...
Bernhard Schueler, Sergej Sizov, Steffen Staab, Du...