Tight representation of logical constraints as cardinality rules

Mathematical Programming, Series B

Volumn 85, Issue 2, 1999, Pages 363-377

  Yan, Hong ^a   Hooker, J N ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008868340     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050061     Document Type: Article

References (10)

1. Araque, J.R., Chandru, V. (1992): Tight polyhedral representation of logical connectives, Technical Report CC-92-3, IIES, Purdue University, West Lafayette, IN 47970 USA, June 1992
2. Blair, C., Jeroslow, R.G., Lowe, J.K. (1988): Some results and experiments in programming techniques for propositional logic. Comput. Oper. Res. 13, 633-645
3. Cook, S.A. (1971): The complexity of theorem-proving procedures. Proceedings of the Third Annual ACM Symposium on the Theory of Computing, pp. 151-158
4. Cook, S.A. (1975): Feasibly Constructive Proofs and the Propositional Calculus. Proceedings of the Seventh Annual ACM Symposium on the Theory of Computing, pp. 83-97
5. Dantzig, G.B. (1963): Linear Programming and Extensions. Princeton University Press
6. Hadjiconstantinou, E., Mitra, G. (1991): Transformation of Propositional Calculus Statements into Integer and Mixed Integer programs: An approach toward automatic reformulation. Technical report TR/04/91. Dept. of Mathematics, Brunel University, Uxbridge, Middlesex UB8 3PH, U.K.
7. Hadjiconstantinou, E., Mitra, G. (1994): A linear and discrete programming framework for representing qualitative knowledge. J. Econ. Dyn. Control 18, 273-297
8. Haken, A. (1985): The intractability of resolution. Theor. Comput. Sci. 39, 297-308
9. Hooker, J.N. (1988): Generalized resolution and cutting planes. Ann. Oper. Res. 12, 217-239
10. Hooker, J.N. (1992): Generalized resolution for 0-1 linear inequalities. Ann. Math. Artificial Intelligence 6, 271-286