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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Udrea, O., Recupero, D. R., & Subrahmanian, V. S. (2006). Annotated RDF. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4011 LNCS, pp. 487–501). Springer Verlag. https://doi.org/10.1007/11762256_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
