text: We further show the usefulness of dormant independencies in [[ model testing ]] and << induction >> by giving an algorithm that uses constraints entailed by dormant independencies to prune extraneous edges from a given causal graph .