Reformulation-based query answering for RDF graphs with RDFS ontologies - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Reformulation-based query answering for RDF graphs with RDFS ontologies


Query answering in RDF knowledge bases has traditionally been performed either through graph saturation, i.e., adding all implicit triples to the graph, or through query reformulation, i.e., modifying the query to look for the explicit triples entailing precisely what the original query asks for. The most expressive fragment of RDF for which Reformulation-based query answering exists is the so-called database fragment [13], in which implicit triples are restricted to those entailed using an RDFS ontology. Within this fragment, query answering was so far limited to the interrogation of data triples (non-RDFS ones); however, a powerful feature specific to RDF is the ability to query data and schema triples together. In this paper, we address the general query answering problem by reducing it, through a pre-query reformulation step, to that solved by the query reformulation technique of [13]. We also report on experiments demonstrating the low cost of our reformulation algorithm
Fichier principal
Vignette du fichier
extended.pdf (734.38 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02051413 , version 1 (12-03-2019)



Maxime Buron, François Goasdoué, Ioana Manolescu, Marie-Laure Mugnier. Reformulation-based query answering for RDF graphs with RDFS ontologies. ESWC 2019 - 16th European Semantic Web Conference, Jun 2019, Portoroz, Slovenia. pp.19-35, ⟨10.1007/978-3-030-21348-0_2⟩. ⟨hal-02051413⟩
498 View
610 Download



Gmail Mastodon Facebook X LinkedIn More