Then, for each disjunctive clause consisting of a set P of positive literals (claims) and a set N of negations of literals, we add the constraint The left-hand side is the union bound of at least one of the claims being true (or false, in the case of negated literals); if this bound is at least 1, the constraint is satisfied.
this optimism can dilute the strength of our constraints by ignoring potential dependence among claims: x ⇒ y, x ∨ y implies y is true, but since we demand only when the claims are mutually exclusive, the union bound is exact; a common constraint is of the form q ⇒ r 1 ∨r 2 ∨.