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.