To allow for tractable probabilistic inference with respect to domain sizes,
lifted probabilistic inference exploits symmetries in probabilistic graphical
models. However, checking whether two factors encode equivalent semantics and
hence are exchangeable is computationally expensive.