Skip to main content
SpringerLink
Log in

Taming Existence in RDF Querying

  • Conference paper
Web Reasoning and Rule Systems (RR 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5341))

Included in the following conference series:

Abstract

We introduce the recursive, rule-based RDF query language RDFLog. RDFLog extends previous RDF query languages by arbitrary quantifier alternation: blank nodes may occur in the scope of all, some, or none of the universal variables of a rule. In addition RDFLog is aware of important RDF features such as the distinction between blank nodes, literals and URIs or the RDFS vocabulary. The semantics of RDFLog is closed (every answer is an RDF graph), but lifts RDF’s restrictions on literal and blank node occurrences for intermediary data. We show how to define a sound and complete operational semantics that can be implemented using existing logic programming techniques. Using RDFLog we classify previous approaches to RDF querying along their support for blank node construction and show equivalence between languages with full quantifier alternation and languages with only ∀ ∃ rules.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Muñoz, S., Pérez, J., Gutierrez, C.: Minimal deductive systems for RDF. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol. 4519. Springer, Heidelberg (2007)

    Google Scholar 

  2. Polleres, A.: From SPARQL to rules (and back). In: Proc. Int’l. World Wide Web Conf (WWW). ACM Press, New York (2007)

    Google Scholar 

  3. Schenk, S., Staab, S.: Networked graphs: A declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the Web. In: Proc. Int’l. World Wide Web Conf (WWW). ACM Press, New York (2008)

    Google Scholar 

  4. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572. Springer, Heidelberg (2002)

    Google Scholar 

  5. Yang, G., Kifer, M.: Reasoning about anonymous resources and meta statements on the Semantic Web. Journal of Data Semantics 1 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Informatics, University of Munich, Oettingenstraße 67, D-80538, München, Germany

    François Bry, Tim Furche & Benedikt Linse

  2. Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, OX1 3QD, England

    Clemens Ley & Bruno Marnette

Authors
  1. François Bry
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tim Furche
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Clemens Ley
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Benedikt Linse
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bruno Marnette
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, Free University of Bozen-Bolzano, Piazza Domenicani 3, 39100, Bolzano, Italy

    Diego Calvanese

  2. Albert-Ludwigs-Universität Freiburg, Fakultät für Angewandte Wissenschaften, Institut für Informatik, Georges-Köhler-Allee, Gebäude 51, 79110, Freiburg, Germany

    Georg Lausen

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bry, F., Furche, T., Ley, C., Linse, B., Marnette, B. (2008). Taming Existence in RDF Querying. In: Calvanese, D., Lausen, G. (eds) Web Reasoning and Rule Systems. RR 2008. Lecture Notes in Computer Science, vol 5341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88737-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88737-9_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88736-2

  • Online ISBN: 978-3-540-88737-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation