A linear-time transformation of linear inequalities into conjunctive normal form

Information Processing Letters

Volumn 68, Issue 2, 1998, Pages 63-69

  Warners, Joost P ^a,b  

^a CWI   (Netherlands)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Automatic theorem proving; Combinatorial optimization; Satisfiability

Indexed keywords

COMPUTATIONAL METHODS; INTEGRAL EQUATIONS; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

BINARY LINEAR PROGRAMMING PROBLEM; CONJUNCTIVE NORMAL FORM; SATISFIABILITY PROBLEM;

MATHEMATICAL TRANSFORMATIONS;

EID: 0032179316     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00144-6     Document Type: Article

References (10)

1. C.E. Blair, R.G. Jeroslow, J.K. Lowe, Some results and experiments in programming techniques for prepositional logic, Comput. Oper. Res. 13 (5) (1986) 633-645.
2. S.A. Cook, The complexity of theorem proving procedures, in: Proc. 3rd Annual ACM Symposium on the Theory of Computing, New York, 1971, pp. 151-158.
3. J.N. Hooker, Unpublished note.
4. J.N. Hooker, Generalized resolution and cutting planes, Ann. of Oper. Res. 12 (1988) 217-239.
5. J.N. Hooker, Logic based methods for optimization, Technical Report, GSIA, Carnegie Mellon University, Pittsburgh, PA, 1994.
6. J.N. Hooker, C. Fedjki, Branch-and-cut solution of inference problems in propositional logic, Ann. of Math. Artificial Intelligence 1 (1990) 123-139.
7. S. Tiourine, C. Hurkens, J.K. Lenstra, An overview of algorithmic approaches to frequency assignment problems, Technical Report, CALMA Project, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, 1995.
8. J.P. Warners, A linear-time transformation of linear inequalities into conjunctive normal form, Technical Report CS-R9631, CWI, Amsterdam, 1996.
9. J.P. Warners, T. Terlaky, C. Roos, B. Jansen, A potential reduction approach to the frequency assignment problem, Discrete Appl. Math. 78 (1-3) (1997) 251-282.
10. J.M. Wilson, Compact normal forms in propositional logic and integer programming formulations, Comput. Oper. Res. 17 (3) (1990) 309-314.