Resolution and the integrality of satisfiability problems

A satisfiability problem can be regarded as a nondisjoint union of set covering problems. We show that if the resolution method of theorem proving is applied to the satisfiability problem, its constraint set defines an integral polytope if and only if the constraint sets of the set covering problems do. In this sense, resolution reduces the integrality question for the satisfiability problem to that for the set covering problem.