Abstract
This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic local search solver. The architecture we use to implement the methods allows the extension of the expression language by user-defined operators, while still benefiting from the processing methods. Results from various domains, including industrial processor verification problems, show the strength of the methods. As one of our test cases, we introduce the concept of random-expression CSPs as a new form of random CSPs. We believe this form emulates many real-world CSPs more closely than other forms of random CSPs. We also observe a satisfiability phase transition in this type of problem ensemble.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
van Hentenryck, P.: The OPL optimization programming language. MIT Press, Cambridge (1999)
Hoos, H.H., Steutzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2004)
Van Hentenryck, P., Michel, L.: Control abstractions for local search. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 65–80. Springer, Heidelberg (2003)
Nareyek, A.: Using global constraints for local search. In: Constraint Programming and Large Scale Discrete Optimization. DIMACS, vol. 57, pp. 9–28 (2001)
Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 (1996)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983), citeseer.ist.psu.edu/kirkpatrick83optimization.html
Minton, S., Johnston, M.D., Phillips, A.B., Laird, P.: Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. In: AAAI-90, pp. 17–24 (1990)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
Hansen, P., Mladenovic, N.: Introduction to variable neighbourhood search. In: Metaheuristics: Advances and Trends in Local Search Procedures for Optimization, pp. 433–458 (1999)
Bacchus, F.: Enhancing Davis Putnam with extended binary clause reasoning. In: AAAI-02 (2002), citeseer.csail.mit.edu/bacchus02enhancing.html
Bacchus, F., Walsh, T.: Propagating logical combinations of constraints. In: IJCAI-05, pp. 35–40 (2005)
Boese, K.D., Kahng, A.B., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimizations. Operations Res. Lett. 16(3), 101–113 (1994)
Bohlin, M.: Improving cost calculations for global constraints in local search. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 772. Springer, Heidelberg (2002)
Naveh, Y.: Stochastic solver for constraint satisfaction problems with learning of high-level characteristics of the problem topography. In: Local Search Techniques in Constraint Satisfaction, LSCS-04 (2004)
Naveh, Y., Rimon, M., Jaeger, I., Katz, Y., Vinov, M., Marcus, E., Shurek, G.: Constraint-based random stimuli generation for hardware verification. AI Magazine (2007)
Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) Principles and Practice of Constraint Programming - CP98. LNCS, vol. 1520, p. 417. Springer, Heidelberg (1998)
Garey, M., Johnson, D.: Computers and Intractability: a Guide to Theory of NP-completeness. W.H. Freeman, New York (1979)
Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. MIT Press, Cambridge (2005)
Adir, A., Bin, E., Peled, O., Ziv, A.: Piparazzi: A test program generator for micro-architecture flow verification. In: Eighth IEEE International High-Level Design Validation and Test Workshop, HLDVT-03, pp. 23–28 (2003)
Naveh, Y., Richter, Y., Altshuler, Y., Gresh, D.L., Connors, D.P.: Workforce optimization: Identification and assignment of professional workers using constraint programming. IBM Journal or Research and Development (2007)
Prosser, P.: An empirical study of phase transition in binary constraint satisfaction problems. Artificial Intelligence 81, 81–109 (1996)
Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Ttroyansky, L.: Determining computational complexity from characteristic ’phase transition’. Nature 400, 133–137 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Sabato, S., Naveh, Y. (2007). Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search. In: Van Hentenryck, P., Wolsey, L. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2007. Lecture Notes in Computer Science, vol 4510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72397-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-72397-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72396-7
Online ISBN: 978-3-540-72397-4
eBook Packages: Computer ScienceComputer Science (R0)