  In this paper we show that inference in 2-variable Markov logic networks
(MLNs) with cardinality and function constraints is domain-liftable. To obtain
this result we use existing domain-lifted algorithms for weighted first-order
model counting (Van den Broeck et al, KR 2014) together with discrete Fourier
transform of certain distributions associated to MLNs.
