Abstract
The paper focuses on automatic programming and how to synthesize stochastic local search algorithms using automatic design of algorithms through evolution (ADATE). The main goal is to provide support for the hypothesis that automatic programming can generate competitive heuristic algorithms. A well studied and highly optimized SAT solver, G2WSAT, is used as a case study. The results indicate that automatic programming is an effective design tool for heuristics and that there may be many well studied optimization problems that could benefit from the ADATE system and the specification methodology that we describe.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bartz-Beielstein, T., Lasarczyk, C.W.G., Preuss, M.: Sequential parameter optimization. In: IEEE Congress on Evolutionary Computation, pp. 773–780 (2005)
Berg, H., Olsson, R., Lindblad, T., Chilo, J.: Automatic design of pulse coupled neurons for image segmentation. Neurocompuing 71(10), 1980–1993 (2008)
Berg, H., Olsson, R., Rusås, P., Jakobsen, M.: Automated synthesis of control algorithms from first principles. In: The 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2009). IEEE Press, St. Louis (2009)
Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third ACM Symposium on Theory of Computing, pp. 151–158 (1971)
Du, D., Gu, J., Pardalos, P.: Satisfiability problem: theory and applications DIMACS series. In: Discrete Mathematics and Theoretical Computer Science, vol. 35 (1997)
Fukunaga, A.S.: Automated discovery of local search heuristics for satisfiability testing. Evol. Comput. 16(1), 31–61 (2008)
Gent, I., Walsh, T.: Towards an understanding of hill-climbing procedures for SAT. In: Proceedings of AAAI-93 (1993)
Hoos, H.H.: On the run-time behaviour of stochastic local search methods for SAT. In: Proceedings of AAAI, pp. 661–666 (1999)
Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. Elsesvier, New York (2005)
Hutter, F., Hoos, H.H., Leyton-Brown, K., Stützle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267–306 (2009)
Huyen, V., Olsson, R.: Automatic improvement of graph based image segmentation. In: 8th International Symposium on Visual Computing. Springer, Berlin (2012)
Koza, J.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Li, C.M., Huang, W.Q.: Diversification and determinism in local search for satisfiability. In: Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science, vol. 3569 (2005)
Linnaeus, C.: Systema Naturae per Regna Tria Naturae, Secundum Classes, Ordines, Genera, Species Cum Caracteribus, Differentiis, Synonymis, Locis, 10th edn. Laurentii Salvii, Stockholm (1758)
Løkketangen, A., Glover, F.: Surrogate constraint analysis: new heuristics and learning schemes for satisfiability problems. In: Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computational Science, vol. 35, pp. 537–572 (1997)
Løkketangen, A., Olsson, R.: Generating meta-heuristic optimization code using ADATE. J. Heuristics. 16(6), 911–930 (2010)
McAllester, D.A., Selman, B., Kautz, H.: Evidence for invariants in local search. In: Proceedings of AAAI-97, pp. 321–326 (1997)
Milner, R., Tofte, M., Harper, R., MacQueen, D.: The Definition of Standard ML (revised). MIT Press, Cambridge (1997)
Moran, P.: The Statistical Processes of Evolutionary Theory. Clarendon Press, Oxford (1962)
Olsson, R.: Inductive functional programming using incremental program transformation. Artif. Intell. 1, 55–83 (1995)
Riedmiller, M., Braun, H.: A direct adaptive method for faster backpropagation learning: the rprop algorithm. In: International Conference on Neural Networks, San Francisco (1993)
Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley, New York (1995)
Selman B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), pp. 440–446 (1992)
Selman B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the National Conference on Artificial Intelligence (AAAI-94), pp. 337–343 (1994)
Selman B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing DIMACS series. In: Discrete Mathematics and Theoretical Computer Science, vol. 26 (1996)
Smit, S.K., Eiben, A.E.: Beating the “world champion” evolutionary algorithm via REVAC tuning. In: IEEE Congress on Evolutionary Computation, pp. 1–8 (2010)
Tompkins, D.A.D., Hoos, H.H.: UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT: In: Revised Selected Papers of the Seventh International Conferences on Theory and Applications of Satisfiability Testing (SAT-04). LNCS, vol. 3542, pp. 306–320 (2005)
Acknowledgments
We would like to thank NOTUR - The Norwegian metacenter for computational science for supplying this project with CPU-time on one of its clusters. We would also like to thank the referees for their valuable comments, contributing to improving this paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Olsson, R., Løkketangen, A. Using automatic programming to generate state-of-the-art algorithms for random 3-SAT. J Heuristics 19, 819–844 (2013). https://doi.org/10.1007/s10732-013-9226-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-013-9226-x