A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form
暂无分享,去创建一个
[1] Armin Haken,et al. The Intractability of Resolution , 1985, Theor. Comput. Sci..
[2] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[3] Cor A. J. Hurkens,et al. An overview of algorithmic approaches to frequency assignment problems , 1995 .
[4] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[5] Tamás Terlaky,et al. A Potential Reduction Approach to the Frequency Assignment Problem , 1997, Discret. Appl. Math..
[6] Peter Barth. Linear 0-1 Inequalities and Extended Clauses , 1993, LPAR.
[7] John N. Hooker,et al. Generalized resolution and cutting planes , 1988 .
[8] John N. Hooker,et al. Logic-Based Methods for Optimization , 1994, PPCP.
[9] Dirk van Dalen,et al. Logic and structure , 1980 .
[10] J. K. Lowe,et al. Some results and experiments in programming techniques for propositional logic , 1986, Comput. Oper. Res..
[11] John M. Wilson. Compact normal forms in propositional logic and integer programming formulations , 1990, Comput. Oper. Res..