In all algorithms that apply an ILP solver, we add a constraint x ij = 1 if i entails j or x ij = 0 if i does not entail j.
intuitively, the topology of an entailment graph is expected to be "tree-like".