This paper presents a first study on answering queries using views in a probabilistic XML setting. We formalize the problem and give a preliminary study of it under the two possible semantics for XML query results, with persistent node identifiers and in their absence. Accordingly, we consider both rewrite plans that rely on a single view, by means of compensation, and plans that use multiple views, by means of intersection. Since in probabilistic settings queries return answers with probabilities, the problem of rewriting goes beyond the one of retrieving answers from views to retrieving answers together with their probabilities. For both semantics of XML results, we show that, even if the answers can be retrieved, the computation of their probabilities might not be possible. We present restrictions that make probabilistic rewriting feasible in polynomial time, and we also present some initial hardness results for this problem.