A class of logic problems solvable by linear programming

DOI10.1145/210118.210137MaRDI QIDQ4369892zbMATH OpenOpenAlexFDO

Authors Michele Conforti, Gérard Cornuéjols

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

balanced matricesinteger programslinear programmingpropositional logictruth assignment

Mathematics Subject Classification ID

Classical propositional logic (03B05) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 1256705
• Integer programs for logic constraint satisfaction
• A linear-time transformation of linear inequalities into conjunctive normal form
• Modeling and integer programming techniques applied to propositional calculus

Cited in

(15)

• 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
• scientific article; zbMATH DE number 1256705 (Why is no real title available?)
• 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

This page was built for publication: A class of logic problems solvable by linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369892)