Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda, SPARQL query containment under RDFS entailment regime, in: Proc. 6^{th }International joint conference on automated reasoning (IJCAR), Manchester (UK), (Bernhard Gramlich, Dale Miller, Uli Sattler (eds), Proc. 6^{th }International joint conference on automated reasoning (IJCAR), Lecture notes in computer science 7364, 2012), pp134-148, 2012

The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another one 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 the mu-calculus where RDF graphs become transition systems, queries and schema axioms become formulas. Thus, the containment problem is reduced to formula satisfiability. Beyond the logic's expressive power, satisfiability solvers are available for it. Hence, this study allows to exploit these advantages.