We describe an algorithm for the satisfiability problem of prepositional logic, which is significantly more efficient for this problem than is a general mixed-integer programming code. Our algorithmâ€¦ (More)

We define the concept of a representation of a set of either linear constraints in bounded integers, or convex constraints in bounded integers. A regularity condition plays a crucial role in theâ€¦ (More)

We provide some results which relate mathematical programming techniques for treating propositional logic to theorem-proving techniques for this logic. We show that the branch-and-bound method,â€¦ (More)

This paper is a survey, with new results, of the algebraic approach to cutting-planes. The new results are a subadditiv: d@ program for integer programs, and a generalization of R. Gomqyâ€™s linearâ€¦ (More)

We give a sequential reduction technique for transforming a formula of the pure predicate calculus to a se~luence of 'increasingly accurate' propositional logic 'approximations" to the predicateâ€¦ (More)