Taming Existence in RDF Querying

Bry, François; Furche, Tim; Ley, Clemens; Linse, Benedikt and Marnette, Bruno (2008): Taming Existence in RDF Querying. Second International Conference, RR 2008, Karlsruhe, Deutschland, 31. Oktober - 1. November 2008. Calvanese, Diego (ed.) : In: Web Reasoning and Rule Systems : Second International Conference, RR 2008, Karlsruhe, Germany, October 31-November 1, 2008. Proceedings, Berlin u.a.: Springer. pp. 236-237

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.

• Item Type: Conference or Workshop Item (Paper)
• Form of publication: Postprint
• Faculties: Mathematics, Computer Science and Statistics > Computer Science
• Subjects: 000 Computer science, information and general works > 004 Data processing computer science
• Place of Publication: Berlin u.a.
• Annotation: The final publication is available at link.springer.com
• Language: English