A class of logic problems solvable by linear programming
A class of logic problems solvable by linear programming
复制标题
线性规划可解的一类逻辑问题
DOI：
--
复制
发表时间：
1992
期刊：
影响因子：
--
通讯作者：
G. Cornuéjols
中科院分区：
文献类型：
--
作者：
M. Conforti;G. Cornuéjols
命题逻辑中的一些问题，如可满足性、MAXSAT和逻辑推理，都可以用整数规划来表示。作者认为这些整数规划可以作为线性规划来解决的条款集。它们证明了子句的平衡集具有这种性质。<<ETX>>
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.<<ETX>>