论文信息 - A class of logic problems solvable by linear programming

A class of logic problems solvable by linear programming

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>>

Gérard Cornuéjols | Michele Conforti | G. Cornuéjols | M. Conforti

[1] Mihalis Yannakakis. On a class of totally unimodular matrices , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[2] Christos H. Papadimitriou,et al. Probabilistic satisfiability , 1988, J. Complex..

[3] John N. Hooker,et al. A quantitative approach to logical inference , 1988, Decis. Support Syst..

[4] Martin Charles Golumbic,et al. Perfect Elimination and Chordal Bipartite Graphs , 1978, J. Graph Theory.

[5] John N. Hooker,et al. Extended Horn sets in propositional logic , 1991, JACM.

[6] D. R. Fulkerson,et al. On balanced matrices , 1974 .

[7] Nils J. Nilsson,et al. Probabilistic Logic * , 2022 .

[8] W. T. Tutte. An algorithm for determining whether a given binary matroid is graphic. , 1960 .

[9] Michele Conforti,et al. Structural properties and recognition of restricted and strongly unimodular matrices , 1987, Math. Program..

[10] Michele Conforti,et al. Structural properties and decomposition of linear balanced matrices , 1992, Math. Program..

[11] Paul D. Seymour,et al. Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.

[12] P. Camion. Characterization of totally unimodular matrices , 1965 .