Annotated RDF

  • Octavian Udrea
  • Diego Reforgiato Recupero
  • V. S. Subrahmanian
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4011)


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.


Partial Order Query Processing Resource Description Framework Conjunctive Query Transitive Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Kahan, J., Koivunen, M.R.: Annotea: an open rdf infrastructure for shared web annotations. In: WWW 2001: Proceedings of the 10th international conference on World Wide Web, pp. 623–632. ACM Press, New York (2001)CrossRefGoogle Scholar
  2. 2.
    Carroll, J.J., Bizer, C., Hayes, P., Stickler, P.: Named graphs, provenance and trust. In: WWW 2005: Proceedings of the 14th international conference on World Wide Web, pp. 613–622. ACM Press, New York (2005)CrossRefGoogle Scholar
  3. 3.
    Karvounarakis, G., Alexaki, S., Christophides, V., Plexousakis, D., Scholl, M.: Rql: a declarative query language for rdf. In: WWW 2002: Proceedings of the 11th international conference on World Wide Web, pp. 592–603. ACM Press, New York (2002)CrossRefGoogle Scholar
  4. 4.
    Gutierrez, C., Hurtado, C., Mendelzon, A.O.: Foundations of semantic web databases. In: PODS 2004: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 95–106. ACM Press, New York (2004)CrossRefGoogle Scholar
  5. 5.
    Gutiérrez, C., Hurtado, C.A., Vaisman, A.A.: Temporal rdf. In: Gómez-Pérez, A., Euzenat, J. (eds.) ESWC 2005. LNCS, vol. 3532, pp. 93–107. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 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. 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
  8. 8.
    Kifer, M., Subrahmanian, V.S.: Theory of generalized annotated logic programming and its applications. J. Log. Program. 12, 335–367 (1992)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Leach, S.M., Lu, J.J.: Query processing in annotated logic programming: Theory and implementation. J. Intell. Inf. Syst. 6, 33–58 (1996)CrossRefGoogle Scholar
  10. 10.
    Fitting, M.: Bilattices and the semantics of logic programming. J. Log. Program. 11, 91–116 (1991)CrossRefMathSciNetzbMATHGoogle Scholar
  11. 11.
    Hlaoui, A., Wang, S.: A new algorithm for inexact graph matching. In: ICPR (4), pp. 180–183 (2002)Google Scholar
  12. 12.
    Gergatsoulis, M., Lilis, P.: Multidimensional RDF. In: Meersman, R., Tari, Z. (eds.) OTM 2005. LNCS, vol. 3761, pp. 1188–1205. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Octavian Udrea
    • 1
  • Diego Reforgiato Recupero
    • 1
  • V. S. Subrahmanian
    • 1
  1. 1.University of MarylandCollege ParkUSA

Personalised recommendations