A class of logic problems solvable by linear programming

DOI10.1145/210118.210137zbMath0900.03025MaRDI QIDQ4369892

Michele Conforti, Cornuéjols, Gérard

Publication date: 28 January 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/210118.210137

zbMATH Keywords

linear programming; propositional logic; integer programs; balanced matrices; truth assignment

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C10: Integer programming

03B05: Classical propositional logic

Related Items

The Running Intersection Relaxation of the Multilinear Polytope, Perfect, ideal and balanced matrices, Optimization and probabilistic satisfiability on nested and co-nested formulas, A logic-based approach to polymer sequence analysis, Ideal clutters, Solving peptide sequencing as satisfiability, On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees, An improved semidefinite programming relaxation for the satisfiability problem, On exact selection of minimally unsatisfiable subformulae, Probability logic and optimization SAT: The PSAT and CPA models, Balanced \(0,\pm 1\) matrices. I: Decomposition, A short note on some tractable cases of the satisfiability problem., Structural properties of affine sparsity constraints, Balanced matrices