  We analyze the so-called ppz algorithm for (d,k)-CSP problems for general
values of d (number of values a variable can take) and k (number of literals
per constraint). To analyze its success probability, we prove a correlation
inequality for submodular functions.
