Querying the Web of Data: A Formal Approach

  • Paolo Bouquet
  • Chiara Ghidini
  • Luciano Serafini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5926)


The increasing amount of interlinked RDF data has finally made available the necessary building blocks for the web of data. This in turns makes it possible (and interesting) to query such a collection of graphs as an open and decentralized knowledge base. However, despite the fact that there are already implementations of query answering algorithms for the web of data, there is no formal characterization of what a satisfactory answer is expected to be. In this paper, we propose a preliminary model for such an open collection of graphs which goes beyond the standard single-graph RDF semantics, describes three different ways in which a query can be answered, and characterizes them semantically in terms of three incremental restrictions on the relation between the domain of interpretation of each single component graph.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bao, J., Voutsadakis, G., Slutzki, G., Honavar, V.: Package-based description logics. In: Stuckenschmidt, H., Parent, C., Spaccapietra, S. (eds.) Modular Ontologies. LNCS, vol. 5445, pp. 349–371. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  2. 2.
    Bizer, C., Cyganiak, R., Heath, T.: How to publish linked data on the web,
  3. 3.
    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, New York (2005)CrossRefGoogle Scholar
  4. 4.
    Ding, L., Finin, T., Peng, Y., Pinheiro da Silva, P., McGuinness, D.L.: Tracking RDF Graph Provenance using RDF Molecules. Technical report, UMBC (April 2005)Google Scholar
  5. 5.
    Ghidini, C., Serafini, L.: Distributed First Order Logics. In: Gabbay, D., de Rijke, M. (eds.) Frontiers Of Combining Systems 2 (Papers presented at FroCoS 1998). Studies in Logic and Computation, pp. 121–140. Research Studies Press/Wiley (1998)Google Scholar
  6. 6.
    ter Horst, H.J.: Completeness, decidability and complexity of entailment for rdf schema and a semantic extension involving the owl vocabulary. J. Web Sem. 3(2-3), 79–115 (2005)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Paolo Bouquet
    • 1
  • Chiara Ghidini
    • 2
  • Luciano Serafini
    • 2
  1. 1.University of TrentoItaly
  2. 2.Fondazione Bruno KesslerTrentoItaly

Personalised recommendations