Modeling and integer programming techniques applied to propositional calculus

Abstract This paper discusses alternative methods for constructing a 0–1 integer programming problem from a propositional calculus problem and the use of the resulting mathematical program to solve the related logic problem. This paper also identifies some special structures associated with the constraint sets and discusses several fundamental results concerning methods of preprocessing the logical inferences into constraints.

[1]  J. K. Lowe,et al.  Some results and experiments in programming techniques for propositional logic , 1986, Comput. Oper. Res..

[2]  Peter L. Hammer,et al.  Boolean Methods in Operations Research and Related Areas , 1968 .

[3]  Robert G. Jeroslow,et al.  Computation-oriented reductions of predicate to propositional logic , 1988, Decis. Support Syst..

[4]  Fred W. Glover,et al.  Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..

[5]  H. P. Williams.  Logical problems and integer programming , 1977 .

[6]  Willard I. Zangwill,et al.  Media Selection by Decision Programming , 1976 .

[7]  Ronald R. Yager,et al.  A Mathematical Programming Approach to Inference with the Capability of Implementing Default Rules , 1988, Int. J. Man Mach. Stud..

[8]  H. P. Williams.  Linear and integer programming applied to the propositional calculus , 1987 .

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

[10]  Fred W. Glover,et al.  Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems , 1973, Oper. Res..

[11]  Michael M. Kostreva,et al.  Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models , 1985, Oper. Res..

[12]  H. P. Williams,et al.  Model Building in Mathematical Programming , 1979 .

[13]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[14]  John N. Hooker,et al.  Generalized resolution and cutting planes , 1988 .

[15]  Pierre Hansen,et al.  A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities , 1986, Math. Program..