Evolving local search heuristics for SAT using genetic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3103, Issue , 2004, Pages 483-494

  Fukunaga, Alex S ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; GENETIC PROGRAMMING; HEURISTIC ALGORITHMS;

EMPIRICAL - COMPARISONS; EVOLUTIONARY APPROACH; GENETIC PROGRAMMING SYSTEM; LOCAL SEARCH ALGORITHM; LOCAL SEARCH HEURISTICS; SATISFIABILITY TESTING; SEARCH EFFICIENCY; STATE OF THE ART;

LOCAL SEARCH (OPTIMIZATION);

EID: 24644438849     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24855-2_59     Document Type: Article

References (13)

1. A. Fukunaga. Automated discovery of composite sat variable-selection heuristics. In Proc. AAAI, pages 641-648, 2002.
2. A. Fukunaga. Efficient implementations of sat local search, to appear in Proceedings of SAT-2004, May 2004.
3. J. Gottlieb, E. Marchiori, and C. Rossi. Evolutionary algorithms for the satisfiability problem. Evolutionary Computation, 10(1):35-50, 2002.
4. H. Hoos. Stochastic local search - methods, models, applications. PhD thesis, TU Darmstadt, 1998.
5. H. Hoos and T. Stutzle. Local search algorithms for sat: An empirical evaluation. Journal of Automated Reasoning, 24:421-481, 2000.
6. J. Koza. Genetic Programming: On the Programming of Computers By the Means of Natural Selection. MIT Press, 1992.
7. D. McAllester, B. Selman, and H. Kautz. Evidence for invariants in local search. In Proc. AAAI, pages 459-465, 1997.
8. D. Mitchell, B. Selman, and H. Levesque. Hard and easy distributions of sat problems. In Proc. AAAI, pages 459-65, 1992.
9. D. Montana. Strongly typed genetic programming. Technical report, Bolt, Beranek and Neuman (BBN), 1993.
10. D. Schuurmans and F. Southey. Local search characteristics of incomplete sat procedures. Artificial Intelligence, 132:121-150, 2001.
11. B. Selman and H. Kautz. Domain-independent extensions to gsat: Solving large structured satisfiability problems. In Proc. Intl. Joint Conf. Artificial Intelligence (IJCAI), 1993.
12. B. Selman, H. Kautz, and B. Cohen. Noise strategies for improving local search. In Proc. AAAI, 1994.
13. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proc. AAAI, pages 440-446, 1992.