Skip to Main content Skip to Navigation
Conference papers

SPARQL Query Containment under RDFS Entailment Regime

Melisachew Wudage Chekol 1 Jérôme Euzenat 1 Pierre Genevès 2 Nabil Layaïda 2
1 EXMO - Computer mediated exchange of structured knowledge
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
2 WAM - Web, adaptation and multimedia
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph Query containment is important in many areas, including information integration query optimization, and reasoning about Entity-Relationship diagrams. We encode this problem into an expressive logic called mu-calculus: where RDF graphs become transition systems, queries and schema axioms become formulas. Thus, the containment problem is reduced to formula satisfiability test. Beyond the logic's expressive power, satisfiability solvers are available for it. Hence, this study allows to exploit these advantages.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Vincent Quint Connect in order to contact the contributor
Submitted on : Tuesday, November 6, 2012 - 4:00:01 PM
Last modification on : Tuesday, November 16, 2021 - 5:04:08 PM
Long-term archiving on: : Saturday, December 17, 2016 - 8:08:16 AM


Files produced by the author(s)




Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda. SPARQL Query Containment under RDFS Entailment Regime. 6th International Joint Conference on Automated Reasoning (IJCAR), Jun 2012, Manchester, United Kingdom. pp.134-148, ⟨10.1007/978-3-642-31365-3_13⟩. ⟨hal-00749087⟩



Record views


Files downloads