• Corpus ID: 5880345

Weaving the Pedantic Web

@inproceedings{Hogan2010WeavingTP,
title={Weaving the Pedantic Web},
author={Aidan Hogan and A. Harth and Alexandre Passant and S. Decker and Axel Polleres},
booktitle={LDOW},
year={2010}
}
• Published in LDOW 2010
• Computer Science
Over a decade after RDF has been published as a W3C recommendation, publishing open and machine-readable content on the Web has recently received a lot more attention, including from corporate and governmental bodies; notably thanks to the Linked Open Data community, there now exists a rich vein of heterogeneous RDF data published on the Web (the so-called \Web of Data") accessible to all. However, RDF publishers are prone to making errors which compromise the e ectiveness of applications…
229 Citations

Figures and Tables from this paper

Binary RDF for scalable publishing, exchanging and consumption in the web of data

This article discusses an ongoing doctoral thesis addressing efficient formats for publication, exchange and consumption of RDF on a large scale, and proposes a binary serialization format for RDF, called HDT.

Lightweighting the Web of Data through Compact RDF/HDT

• Computer Science
CAEPIA
• 2011
This paper revisits the HDT format and exploits the latest findings in triples indexing for querying, exchanging and visualizing RDF information at large scale.

Characterising RDF data sets

• Computer Science
J. Inf. Sci.
• 2018
This work addresses the issue of structural features emerging in real-world RDF data by proposing specific metrics to characterise RDFData, and specifically focuses on revealing the redundancy of each data set, as well as common structural patterns.

Linked Data Quality

In this work, a set of experiments were conducted on a real-world dataset (DBpedia) to evaluate the proposed approaches to linked data quality dimensions, especially the completeness and conciseness of linked datasets.

Reasoning with Noisy Semantic Data

• Computer Science
ESWC
• 2011
Based on URIs, HTTP and RDF, the Linked Data project [3] aims to expose, share and connect related data from diverse sources on the SemanticWeb. Linked Open Data (LOD) is a community effort to apply

Assessing the Completeness Evolution of DBpedia: A Case Study

• Computer Science
ER Workshops
• 2017
The paper presents a set of experiments aiming to analyze the evolution of completeness quality values over several versions of DBpedia, interested in data quality and precisely in completenessquality evolution over time.

Can we ever catch up with the Web?

• Computer Science
Semantic Web
• 2010
The Semantic Web is about to grow up. By efforts such as the Linking Open Data initiative, we finally find ourselves at the edge of a Web of Data becoming reality. Standards such as OWL 2, RIF and

An Analysis of Data Quality in DBpedia and Zhishi.me

• Computer Science
CSWS
• 2013
This paper presents some problems concerning the quality of Linked Data discovered through analysis on two cross-domain RDF datasets: DBpedia and Zhishi.me, both of which are based on automatic extraction of resources from existing encyclopedias.

A Rule-Based Approach to Address Semantic Accuracy Problems on Linked Data

The number of available datasets that follow the SW and LD ideas has been considerably increasing, leading to what is currently known as the Web of Data (WoD).

References

SHOWING 1-10 OF 34 REFERENCES

Context Dependent Reasoning for Semantic Documents in Sindice

• Computer Science
• 2008
The notion of context dependent reasoning for RDF documents published on the Web according to the linked data principle is introduced and an efficient methodology to perform context dependent RDFS and partial OWL inference based on a persistent TBox composed of a network of web ontologies is illustrated.

Linked Data

• Computer Science
Semantic Services, Interoperability and Web Applications
• 2011
This Synthesis lecture provides readers with a detailed technical introduction to Linked Data, including coverage of relevant aspects of Web architecture, and provides guidance and best practices on architectural approaches to publishing Linked data.

Performing Object Consolidation on the Semantic Web Data Graph

• Computer Science
I3
• 2007
A method for performing large-scale object consolidation to merge identifiers of equivalent instances occurring across data sources is presented; the algorithm is based on the analysis of defined inverse functional properties: properties which have values unique to an instance.

Characterizing the Semantic Web on the Web

• Computer Science
SEMWEB
• 2006
A collection of Semantic Web documents from an estimated ten million available on the Web is harvested and analyzed, and a number of metrics, properties and usage patterns found to follow a power law distribution are described.

Logical Foundations of (e)RDF(S): Complexity and Reasoning

• Computer Science
ISWC/ASWC
• 2007
This paper considers embeddings of RDF and RDFS in logic to show how techniques from deductive databases and description logics can be used for reasoning with RDF(S) and establishes several novel complexity results.

MultiCrawler: A Pipelined Architecture for Crawling and Indexing Semantic Web Data

• Computer Science
SEMWEB
• 2006
This work contrasts the approach to conventional web crawlers, and describes and evaluates a five-step pipelined architecture to crawl and index data from both the traditional and the Semantic Web.

Minimal Deductive Systems for RDF

• Computer Science
ESWC
• 2007
This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler language which preserves the

application/rdf+xml Media Type Registration

This document describes a media type (application/rdf+xml) for use with the Extensible Markup Language (XML) serialization of the Resource Description Framework (RDF). RDF is a language designed to

A Survey of the Web Ontology Landscape

• Computer Science
SEMWEB
• 2006
The collection of statistical data allows us to perform analysis and report some trends and it is noted that of the largest ontologies surveyed here, most do not exceed the description logic expressivity of $\mathcal{ALC}$.

Opening, Closing Worlds - On Integrity Constraints

• Computer Science
OWLED
• 2008
This paper explores how OWL can be extended to accommodate integrity constraints and discusses several alternatives for the syntax and semantics of such an extension and focuses on applications in the Supply Chain Management (SCM) domain.