Annotated RDF

Octavian Udrea*, Diego Reforgiato Recupero, V. S. Subrahmanian

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Scopus citations

Abstract

There are numerous extensions of RDF that support temporal reasoning, reasoning about pedigree, reasoning about uncertainty, and so on. In this paper, we present Annotated RDF (or aRDF for short) in which RDF triples are annotated by members of a partially ordered set (with bottom element) that can be selected in any way desired by the user, We present a formal declarative semantics (model theory) for annotated RDF and develop algorithms to check consistency of aRDF theories and to answer queries to aRDF theories. We show that annotated RDF captures versions of all the forms of reasoning mentioned above within a single unified framework. We develop a prototype aRDF implementation and show that our algorithms work very fast indeed - in fact, in just a matter of seconds for theories with over 100,000 nodes.

Original languageEnglish (US)
Title of host publicationThe Semantic Web
Subtitle of host publicationResearch and Applications: 3rd European Semantic Web Conference, ESWC 2006 Proceedings
PublisherSpringer Verlag
Pages487-501
Number of pages15
ISBN (Print)3540345442, 9783540345442
DOIs
StatePublished - 2006
Externally publishedYes
Event3rd European Semantic Web Conference, ESWC 2006 - Budva
Duration: Jun 11 2006Jun 14 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4011 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd European Semantic Web Conference, ESWC 2006
CityBudva
Period6/11/066/14/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Annotated RDF'. Together they form a unique fingerprint.

Cite this