DMCA
Annotated rdf (2006)
| Venue: | In ESWC. 487–501 |
| Citations: | 15 - 1 self |
BibTeX
@INPROCEEDINGS{Udrea06annotatedrdf,
author = {Octavian Udrea and Diego Reforgiato Recupero and V. S. Subrahmanian},
title = {Annotated rdf},
booktitle = {In ESWC. 487–501},
year = {2006},
pages = {487--501},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
There are numerous extensions of RDF that support reasoning about uncertainty, reasoning about pedigree, reasoning about time, 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 efficiently even on real world data sets containing over 10 million triples.
