A SAT-based decision procedure for mixed logical/integer linear problems

Lecture Notes in Computer Science

Volumn 3524, Issue , 2005, Pages 320-335

  Sheini, Hossein M ^a   Sakallah, Karem A ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DECISION MAKING; ENCODING (SYMBOLS); HEURISTIC METHODS; POLYNOMIALS;

BOOLEAN SAT SOLVERS; LINEAR CONSTRAINTS; MIXED LOGICAL/INTEGER LINEAR PROGRAMMING (MLILP); UNIT-TWO-VARIABLE-PER-INEQUALITY;

LINEAR PROGRAMMING;

EID: 26444439129     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11493853_24     Document Type: Conference Paper

References (26)

1. F. Aloul, A. Ramani, I. Markov, and K. Sakallah, "Generic ILP versus Specialized 0-1 ILP: an Update," ICCAD, pp. 450-457, 2002.
2. R. Alur and D. L. Dill, "A Theory of Timed Automata," Theoretical Computer Science, vol. 126, pp. 183-235, 1994.
3. D. Applegate and B. Cook "A Computational Study of the Job Shop Scheduling Problem," ORSA Journal on Computing, vol.3(2), pp. 149-156, 1991.
4. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowics, and R. Sebastiani, "A SAT-Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions," CADE, pp. 193-208, 2002.
5. C. Barrett, D. Dill, and J. Levitt, "Validity Checking for Combinations of Theories with Equality," FMCAD, LNCS 1166, pp. 187-201, 1996
6. A. Bemporad and N. Giorgetti, "SAT-based Branch & Bound and Optimal Control of Hybrid Dynamical Systems," CP-AI-OR, pp. 96-111, 2004.
7. R. Ben Salah, M. Bozga, and O. Maler, "On Timing Analysis of Combinational Circuits," FORMATS, 2004
8. J. A. Brzozowski and C.J.H. Seger, "Asynchronous Circuits," Springer, 1994.
9. Dash Inc., XPRESS-MP 15.25.03, http://www.dashoptimization.com.
10. M. Davis and H. Putnan, "A Computing Procedure for Qualification Theory," Journal of the ACM, vol. 7, pp. 102-215, 1960.
11. M. Davis, G. Logemann, and D. Loveland. "A Machine Program for Theorem Proving," Communications of the ACM, vol. 7, pp. 394-397, 1962.
12. M. Dell'Amico and M. Trubian "Applying Tabu Search to the Job-Shop Scheduling Problem" Annals of Operations Research, vol. 41, pp. 231-252, 1993.
13. N. Eén and N. Sörensson, "An Extensible SAT-solver," SAT, pp. 502-508, 2003.
14. I. E. Grossmann and Z. Kravanja, "Mixed Integer Nonlinear Programming: A Survey of Algorithms and Applications," Large-Scale Optimization with Applications, Part II: Optimal Design Control, Springer-Verlag, pp. 73-100, 1997.
15. I. E. Grossmann and N. V. Sahinidis, (eds) "Special Issue on Mixed Integer Programming and its Application to Engineering," Part I/II, Optim. and Engin., 2002.
16. J. N. Hooker, "Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction," Wiley, 2002.
17. J. N. Hooker, G. Ottosson, E. S. Thorsteinsson, and H. Kim, "On Integrating Constraint Propagation and Linear Programming for Combinatorial Optimization", AAAI, pp. 136-141, 1999.
18. ILOG CPLEX, http://www.ilog.com/products/cplex.
19. J. Jaffar, M. Maher, P. Suckey, and R. Yap, "Beyond Finite Domains," Workshop on Principles and Practice of Constraint Programming, 1994.
20. S. Lawrence, "Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement)," Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1984.
21. J. P. Marques-Silva and K. A. Sakallah, "GRASP: A Search Algorithm for Prepositional Satisfiability," IEEE Trans, on Computers, vol. 48(5), pp. 506-521, 1999.
22. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT Solver," DAC, pp. 530-535, 2001.
23. R. Raman, I. E. Grossmann, "Modelling and Computational Techniques for Logic Based Integer Programming," Computers and Chemical Engineering, vol. 18, 1994.
24. R. Shostak, "Deciding Linear Inequalities by Computing Loop Residues," Journal of the ACM, vol. 28(4) pp. 769-779, 1981.
25. S. Seshia and R. Bryant, "Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds," LICS, pp. 100-109, 2004.
26. D. Wagner, J. S. Foster, E. A. Brewer, and A. Aiken, "A First Step Towards Detection of Buffer Overrun Vulnerabilities," Network and Distributed System Security Symposium, Internet Society, 2000.