论文信息 - Resolution and the integrality of satisfiability problems

Resolution and the integrality of satisfiability problems

A satisfiability problem can be regarded as a nondisjoint union of set covering problems. We show that if the resolution method of theorem proving is applied to the satisfiability problem, its constraint set defines an integral polytope if and only if the constraint sets of the set covering problems do. In this sense, resolution reduces the integrality question for the satisfiability problem to that for the set covering problem.

John N. Hooker | J. Hooker

[1] Gérard Cornuéjols,et al. A class of logic problems solvable by linear programming , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[2] Willard Van Orman Quine,et al. The Problem of Simplifying Truth Functions , 1952 .

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

[4] Willard Van Orman Quine,et al. A Way to Simplify Truth Functions , 1955 .

[5] Pierre Hansen,et al. Column Generation Methods for Probabilistic Logic , 1989, INFORMS J. Comput..

[6] Brigitte Jaumard,et al. On the Complexity of the Maximum Satisfiability Problem for Horn Formulas , 1987, Inf. Process. Lett..

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

[8] Armin Haken,et al. The Intractability of Resolution , 1985, Theor. Comput. Sci..

[9] John N. Hooker,et al. Bayesian logic , 1994, Decision Support Systems.

[10] David K. Smith. Theory of Linear and Integer Programming , 1987 .

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

[12] John N. Hooker,et al. A linear programming framework for logics of uncertainty , 1996, Decis. Support Syst..

[13] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[14] Gérard Cornuéjols,et al. A class of logic problems solvable by linear programming , 1995, JACM.