A polyhedral projection procedure for Q2SAT

In this paper, we show that the Fourier-Motzkin elimination procedure can be used to solve instances of Quantified 2SAT problems without resorting to modulo arithmetic or congruences. The closure of 2SAT formulae under the elimination procedure allows us to conclude that integer programs which are similarly closed can be solved in polynomial time, using this procedure.