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.
KeywordsPartial Order Query Processing Resource Description Framework Conjunctive Query Transitive Property
- 6.Dubois, M.D., Prade, H.M.: Possibilistic uncertainty and fuzzy features in description logic: a preliminary discussion. In: Sanchez, E. (ed.) Proc. Workshop on Fuzzy Logic and the Semantic Web, pp. 5–7 (2005)Google Scholar
- 7.Straccia, U.: Towards a fuzzy description logic for the semantic web. In: Sanchez, E. (ed.) Proc. Workshop on Fuzzy Logic and the Semantic Web, p. 3 (2005)Google Scholar
- 11.Hlaoui, A., Wang, S.: A new algorithm for inexact graph matching. In: ICPR (4), pp. 180–183 (2002)Google Scholar