We give a complexity dichotomy for the problem of computing the partition function of a weighted Boolean constraint satisfaction problem. Such a problem is parameterized by a set Γ of rational functions, each of which assigns a weight to each variable assignment. Our dichotomy extends previous work in which the weight functions were restricted to being non-negative. We represent a weight functi...
