A class of logic problems solvable by linear programming

Authors:
M. Conforti;G. Cornuejols
Affiliations:
Dipartmento di Matematica, Padova Univ., Italy;-
Venue:
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Year:
1992

Citing 0
Cited 1

Integer programming

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several problems of propositional logic, such as satisfiability, MAXSAT and logical inference, can be formulated as integer programs. The authors consider sets of clauses for which these integer programs can be solved as linear programs. They prove that balanced sets of clauses have this property.