Till now, we have not talked about inference in programs with continuous RVs. Nevertheless, the notions discussed so far are sufficient to explain inference in such programs. Likelihood weighting naturally extends to continuous domains [1]}. We just need rules to resolve comparison atoms of the form \(\mathtt {V_1 \diamond V_2}\)  that appear in the body of clauses. These rules are already present in the proof procedure.
