Automated discovery of local search heuristics for satisfiability testing

Evolutionary Computation

Volumn 16, Issue 1, 2008, Pages 31-61

  Fukunaga, Alex S ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Constraint satisfaction; Genetic programming; Hybrid genetic local search; Hyper heuristic; SAT; Satisfiability

Indexed keywords

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; EVOLUTION; STATISTICAL MODEL; THEORETICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; EVOLUTION; MODELS, STATISTICAL; MODELS, THEORETICAL;

EID: 42449117713     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2008.16.1.31     Document Type: Article

References (44)

1. Aler, R., Borrajo, D., and Isasi, P (2002). Using genetic programming to learn and improve control knowledge. Artificial Intelligence, 141(1-2), 29-56.
2. Burke, E., Hyde, M., and Kendall, G. (2006). Evolving bin packing heuristics with genetic programming. In Proceedings of the Ninth International Conference on Parallel Problem Solving from Nature (PPSN), Lecture Notes in Computer Science Vol. 4193, pp. 860-869. New York: Springer.
3. Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., and Schulenburg, S. (2003). Hyper-heuristics: An emerging direction in modern search technology. In Glover, F., and Kochenberger, G. (Eds.), Handbook of Meta-heuristics, chap. 16 (pp. 457-474). Dordrecht, The Netherlands: Kluwer.
4. Cowling, P., Kendall, G., and Soubeiga, E. (2001). A hyperheuristic approach to scheduling a sales summit. In Burke, E., and and Erben, W. (Eds.), Selected Papers of the Third International Conference on the Practice and Theory of Automated Timetabling (PATAT 2000), Lecture Notes in Computer Science, pp. 176-190.
5. de Jong, M., and Kosters, W. (1998). Solving 3-SAT using adaptive sampling. In Poutre, H., and van den Herik, J. (Eds.), Proceedings of the Tenth Dutch/Belgian Artificial Intelligence Conference, pp. 221-228.
6. Eiben, A., and van der Hauw, J. (1997). Solving 3-SAT with adaptive genetic algorithms. In Proceedings of the Fourth IEEE Conference on Evolutionary Computation, pp. 81-86.
7. Fukunaga, A. (2002). Automated discovery of composite SAT variable-selection heuristics. In Proceedings of the AAAI, pp. 641-648.
8. Fukunaga, A. (2004a). Efficient implementations of SAT local search. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT-2004), pp. 287-292, Vancouver, British Columbia.
9. Fukunaga, A. (2004b). Evolving local search heuristics for SAT. In Proc. Genetic and Evolutionary Computation Conference (GECCO), Vol. 3103 of Lecture Notes in Computer Science, pp. 483-494. Berlin: Springer-Verlag.
10. Gent, I. and Walsh, T. (1993). Towards an understanding of hill-climbing procedures for SAT. In Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 28-33.
11. Gomes, C. and Selman, B. (1997). Algorithm portfolio design: Theory vs. practice. In Proceedings of Uncertainty in Artificial Intelligence (UAI).
12. Gottlieb, J., Marchiori, E., and Rossi, C. (2002). Evolutionary algorithms for the satisfiability problem. Evolutionary Computation, 20(1), 35-50.
13. Gottlieb, J., and Voss, N. (2000). Adaptive fitness functions for the satisfiability problem. In Proceedings of the Conference on Parallel Problem Solving from Nature, Vol. 1917 of Lecture Notes in Computer Science, pp. 621-630. Berlin: Springer-Verlag.
14. Gratch, J., and Chien, S. (1996). Adaptive problem-solving for large-scale scheduling problems: A case study. Journal of Artificial Intelligence Research, 4, 365-396.
15. Hoos, H. (1998). Stochastic local search - Methods, models, applications. Ph.D. thesis, Technical University Darmstadt.
16. Hoos, H. (1999). On the run-time behavior of stochastic local search algorithms for SAT. In Proceedings of AAAI, pp. 661-666.
17. Hoos, H., and Stutzle, T. (2000). Local search algorithms for SAT: An empirical evaluation. Journal of Automated Reasoning, 24, 421-481.
18. Huberman, B., Lukose, R., and Hogg, T. (1997). An economics approach to hard computational problems. Science, 275(5269), 51-54.
19. Hutter, F., Tompkins, D., and Hoos, H. (2002). Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In Proceedings of the Eighth International Conference on the Principles and Practice of Constraint Programming (CP'02), pp. 233-248.
20. Kautz, H. (2006). Deconstructing planning as satisfiability. In Proceedings of the Twenty-first National Conference on Artificial Intelligence (AAAI-06), pp. 1524-1526.
21. Koza, J. (1992). Genetic programming: On the programming of computers by the means of natural selection. Cambridge, MA: MIT Press.
22. Krasnogor, N., and Gustafson, S. (2004). A study on the use of "self-generation" in memetic algorithms. Natural Computing, 3(1), 53-76.
23. Krasnogor, N., and Smith, J. (2000). A memetic algorithm with self-adaptive local search: TSP as a case study. In Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2000), pp. 987-994. San Mateo, CA: Morgan Kauffman.
24. Lardeux, F., Saubion, F., and Hao, J.-K. (2006). GASAT: A genetic local search algorithm for the satisfiability problem. Evolutionary Computation, 24(2), 223-253.
25. Luke, S., and Panait, L. (2006). A comparison of bloat control methods for genetic programming. Evolutionary Computation, 24(3), 309-344.
26. Marchiori, E., and Rossi, C. (1999). A flipping genetic algorithm for hard 3-SAT problems. In Proceedings of Genetic and Evolutionary Computation Conference, pp. 393-400. San Mateo, CA: Morgan Kaufmann.
27. McAllester, D., Selman, B., and Kautz, H. (1997). Evidence for invariants in local search. In Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 459-465.
28. Merz, P., and Freisleben, B. (2000). Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning. Evolutionary Computation, 8(1), 61-91.
29. Minton, S. (1996). Automatically configuring constraint satisfaction problems: A case study. Constraints, 2(1).
30. Mitchell, D., Selman, B., and Levesque, H. (1992). Hard and easy distributions of SAT problems. In Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 459-465.
31. Montana, D. (1993). Strongly typed genetic programming. Tech. Rep. Cambridge, MA: Bolt, Beranek and Newman (BBN).
32. Pham, D., Thornton, J., and Sattar, A. (2007). Building structure into local search for SAT. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 2359-2364.
33. Ross, P., Schulenburg, S., Marin-Blazques, J. G., and Hart, E. (2002). Hyper-heuristics: Learning to combine simple heuristics in bin-packing problems. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), pp. 924-948.
34. Rossi, C., Marchiori, E., and Kok, J. (2000). An adaptive evolutionary algorithm for the satisfiability problem. In Proceedings of ACM Symposium on Applied Computing, pp. 463-469, New York: ACM.
35. Schuurmans, D., and Southey, R (2001). Local search characteristics of incomplete SAT procedures. Artificial Intelligence, 132, 121-150.
36. Selman, B., and Kautz, H. (1993). Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI).
37. Selman, B., Kautz, H., and Cohen, B. (1994). Noise strategies for improving local search. In Proceedings of the National Conference on Artificial Intelligence (AAAI).
38. Selman, B., Levesque, H., and Mitchell, D. (1992). A new method for solving hard satisfiability problems. In Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 440-446.
39. Smith, J. (2002). Co-evolution of memetic algorithms: Initial results. In Proceedings of the Seventh International Conference on Parallel Problem Solving from Nature (PPSN), Lecture Notes in Computer Science Vol. 4193, pp. 537-548. New York: Springer.
40. Southey, R (2005). Constraint metrics for local search. In Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT-2005), pp. 269-281.
41. Stephenson, M., O'Reilly, U., Martin, M., and Amarasinghe, S. (2003). Meta optimization: Improving compiler heuristics with machine learning. In Proceedings of the SIGPLAN '03 Conference on Programming Language Design and Implementation, San Diego, CA.
42. Thornton, J. (2005). Clause weighting local search for SAT. Journal of Automated Reasoning, 35(1-3), 97-142.
43. Velev, M., and Bryant, R. (2003). Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. Journal of Symbolic Computation, 35(2), 73-106.
44. Whitley, D. (1989). The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In Proceedings of the International Conference on Genetic Algorithms (ICGA), pp. 116-121.