Annotated RDF

Presented at: 3rd European Semantic Web Conference (ESWC2006)

by Octavian Udrea, Diego Reforgiato Recupero, Vs Subrahmanian

Webpage: http://www.springerlink.com/content/3h0150xv51j54xum/?p=beb34c7306ec4800a7ba2b273fc16e78

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. Work supported in part by ARO grant DAAD190310202, AFOSR grant FA95500510298, the Joint Institute for Knowledge Discovery, and by a DARPA subcontract from the Univ. of California Berkeley.

Annotated RDF was presented at this event.

Keywords: Ontology population / generation


Resource URI on the dog food server: http://data.semanticweb.org/conference/eswc/2006/paper/udrea-recupero
Same as: http://www.eswc2006.org/full-papers/#udrea-recupero


Explore this resource elsewhere: