Evolutionary algorithms for the satisfiability problem

Evolutionary Computation

Volumn 10, Issue 1, 2002, Pages 35-50

  Gottlieb, Jens ^a   Marchiori, Elena ^b   Rossi, Claudio ^c  

^a SAP RESEARCH   (Germany)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

^c CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Adaptive fitness function; Evolutionary algorithm; Local search; Satisfiability problem; WSAT

Indexed keywords

ALGORITHM; BIOLOGICAL MODEL; EVOLUTION; REVIEW; THEORETICAL MODEL;

ALGORITHMS; EVOLUTION; MODELS, GENETIC; MODELS, THEORETICAL;

EID: 0036516407     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/106365602317301763     Document Type: Article

References (39)

1. Bäck, T., Eiben, A., and Vink, M. (1998). A superior evolutionary algorithm for 3-SAT. In Saravanan, N., Waagen, D., and Eiben, A., editors, Proceedings of the Seventh Annual Conference on Evolutionary Programming. Lecture Notes in Computer Science, Volume 1477, pages 125-136, Springer, Berlin, Germany.
2. Battiti, R. and Protasi, M. (1998). Approximate algorithms and heuristics for MAX-SAT. In Du, D.-Z. and Pardalos, P., editors. Handbook of Combinatorial Optimization, pages 77-148, Kluwer, Boston, Massachusetts.
3. Brayton, R. et al. (1985). Logic Minimization Algorithms for VLSI minimization, Kluwer, Boston, Massachusetts.
4. Cook, S. (1971). The complexity of theorem-proving procedures. In Proceedings of Third Annual ACM Symposium on Theory of Computing, pages 151-158, ACM, New York, New York.
5. Craenen, B. et al. (2000). Combining local search and fitness function adaptation in a GA for solving binary constraint satisfaction problems. In Whitley, D. et al., editors, Proceedings of Genetic and Evolutionary Computation Conference, page 381, Morgan Kaufmann, San Francisco, California.
6. De Jong, K. (1975). An analysis of the behaviour of a class of genetic adaptive systems. Doctoral Dissertation, University of Michigan, Ann Arbor, Michigan. Dissertation Abstract International 36(10), 5140B.
7. De Jong, K. and Spears, W. (1989). Using genetic algorithms to solve NP-complete problems. In Schaffer, J. D., editor, Proceedings of the Third international Conference on Genetic Algorithms, pages 124-132, Morgan Kaufmann, San Mateo, California.
8. de Jong, M. and Kosters, W. (1998). Solving 3-SAT using adaptive sampling. In Poutré, H. L. and van den Herik, J., editors, Proceedings of the Tenth Dutch/Belgian Artificial Intelligence Conference, pages 221-228.
9. Dongarra, J. (1993). Performance of various computers using standard linear equations software. Technical Report CS89-85, Computer Science Department, University of Tennessee, Knoxville, Tennessee.
10. Du, D., Gu, J., and Pardalos, P., editors (1997). Satisfiability Problem: Theory and Applications, volume 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, Providence, Rhode Island.
11. 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, pages 81-86, IEEE Press, Piscataway, New Jersey.
12. Fleurent, C. and Ferland, J. (1996). Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. In Trick, M. and Johnson, D. S., editors. Second DIMACS Challenge, special issue, Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 619-652, AMS, Providence, Rhode Island.
13. Folino, G., Pizzuti, C., and Spezzano, G. (1998). Combining cellular genetic algorithms and local search for solving satisfiability problems. In Proceedings of Tenth IEEE International Conference on Tools with Artificial Intelligence, pages 192-198, IEEE, Piscataway, New Jersey.
14. Frank, J. (1994). A study of genetic algorithms to find approximate solutions to hard 3CNF problems. In Yfantis, A., editor, Proceedings of Golden West International Conference on Artificial Intelligence, Kluwer, Boston, Massachusetts.
15. Frank, J. (1996). Weighting for Godot: Learning heuristics for GSAT. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pages 338-343, AAA1 Press, Menlo Park, California.
16. Garey, M. and Johnson, D. (1979). Computers and Intractability: a Guide to the Theory of NP-completeness, Freeman, San Francisco, California.
17. Gottlieb, J. and Voss, N. (1998a). Improving the performance of evolutionary algorithms for the satisfiability problem by refining functions. In Eiben, A. et al., editors, Proceedings of the Fifth International Conference on Parallel Problem Solving from Nature. Lecture Notes in Computer Science, Volume 1498, pages 755-764, Springer, Berlin, Germany.
18. Gottlieb, J. and Voss, N. (1998b). Representations, fitness functions and genetic operators for the satisfiability problem. In Hao, J.-K. et al., editors. Proceedings of Artificial Evolution. Lecture Notes in Computer Science, Volume 1363, pages 55-68, Springer, Berlin, Germany.
19. Gottlieb, J. and Voss, N. (2000). Adaptive fitness functions for the satisfiability problem. In Schoenauer, M., editors, Proceedings of the Sixth International Conference on Parallel Problem Solving from Nature. Lecture Notes in Computer Science, Volume 1917, pages 621-630, Springer, Berlin, Germany.
20. Hao, J.-K. (1995). A clausal genetic representation and its evolutionary procedures for satisfiability problems. In Pearson, D., Steele, N., and Albrecht, R., editors, Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, pages 289-292, Springer, Vienna, Austria.
21. Hoos, H. (1998). Stochastic Local Search - Methods, Models, Applications. PhD thesis, Darmstadt University of Technology, Germany.
22. Larrabee, T. (1992). Efficient generation of test patterns using Boolean satisfiability. IEEE Transactions on Computer-Aided Design, 11(1):4-15.
23. Larrabee, T. and Tsuji, Y. (1992). Evidence for a satisfiability threshold for random 3CNF formulas. Technical Report UCSC-CRL-92-42, University of California, Santa Cruz, California.
24. Marchiori, E. and Rossi, C. (1999). A flipping genetic algorithm for hard 3-SAT problems. In Banzhaf, W. et al., editors, Proceedings of Genetic and Evolutionary Computation Conference, pages 393-400, Morgan Kaufmann, San Francisco, California.
25. McAllester, D., Selman, B., and Kautz. H. (1997). Evidence for invariants in local search. In Proceedings of the National Conference on Artificial Intelligence, pages 321-326, AAAI Press, Menlo Park, California.
26. Mitchell, D., Selman, B., and Levesque, H. (1992). Hard and easy distributions of SAT problems. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 459-465, AAAI Press, Menlo Park, California.
27. Park, K. (1995). A comparative study of genetic search. In Eshelman, L., editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 512-519, Morgan Kaufmann, San Francisco, California.
28. Rana, S. and Whitley, D. (1998). Genetic algorithm behavior in the MAXSAT domain. In Eiben, A. et al., editors, Proceedings of the Fifth International Conference on Parallel Problem Solving from Nature. Lecture Notes in Computer Science, Volume 1498, pages 785-794, Springer, Berlin, Germany.
29. Resende, M. and Feo, T. (1996). A GRASP for satisfiability. In Trick, M. and Johnson, D. S., editors (1996). Second DIMACS Challenge, special issue, Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 499-520, AMS, Providence, Rhode Island.
30. Rossi, C., Marchiori, E., and Kok, J. (2000). An adaptive evolutionary algorithm for the satisfiability problem. In Carroll, J. et al., editors, Proceedings of ACM Symposium on Applied Computing, pages 463-469, ACM, New York, New York.
31. Selman, B., Kautz, H., and Cohen, B. (1994). Noise strategies for improving local search. In Proceedings of the Twelfth National Conference on Artificial Intelligence, pages 337-343, AAAI Press, Menlo Park, California.
32. Selman, B., Levesque, H., and Mitchell. D. (1992). A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 440-446, AAAI Press, Menlo Park, California.
33. Singer, J., Gent, I., and Smaill, A. (2000). Backbone fragility and the local search cost peak. Journal of Artificial Intelligence Research, 12:235-270.
34. Spears, W. (1996). Simulated annealing for hard satisfiability problems. In Trick, M. and Johnson, D. S., editors. Second DIMACS Challenge, special issue, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 533-558, AMS, Providence, Rhode Island.
35. Syswerda, G. (1989). Uniform crossover in genetic algorithms. In Schaffer, J., editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 2-9, Morgan Kaufmann, San Mateo, California.
36. Trick, M. and Johnson, D. S., editors (1996). Second DIMACS Challenge, special issue, Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, Providence, Rhode Island.
37. Tseitin, G. (1968). On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic, 2:115-125.
38. Warners, J. (1999). Nonlinear Approaches to Satisfiability Problems. PhD thesis, Eindhoven University of Technology, The Netherlands.
39. Whitley, D. (1993). Cellular genetic algorithms. In Forrest, S., editor, Proceedings of the Fifth International Conference on Genetic Algorithms, page 658, Morgan Kaufmann, San Mateo, California.