A class of logic problems solvable by linear programming
From MaRDI portal
Publication:4369892
DOI10.1145/210118.210137zbMath0900.03025OpenAlexW2057441901MaRDI 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
Numerical mathematical programming methods (65K05) Integer programming (90C10) Classical propositional logic (03B05)
Related Items
Structural properties of affine sparsity constraints, Balanced matrices, Optimization and probabilistic satisfiability on nested and co-nested formulas, A logic-based approach to polymer sequence analysis, Solving peptide sequencing as satisfiability, Ideal clutters, Perfect, ideal and balanced matrices, 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, The Running Intersection Relaxation of the Multilinear Polytope, On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees, Balanced \(0,\pm 1\) matrices. I: Decomposition, A short note on some tractable cases of the satisfiability problem.
