Representations, fitness functions and genetic operators for the satisfiability problem

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

Volumn 1363, Issue , 1998, Pages 55-68

  Gottlieb, Jens ^a   Voss, Nico ^a  

^a CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS;

CLASSICAL BITS; FITNESS FUNCTIONS; FITNESS LANDSCAPE; GENETIC OPERATORS; PROBLEM-SPECIFIC KNOWLEDGE; SATISFIABILITY PROBLEMS; SOLUTION REPRESENTATION;

FORMAL LOGIC;

EID: 84957556019     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0026590     Document Type: Conference Paper

References (16)

1. M. Davis and H. Putnam. A Computing Procedure for Quantification Theory. Journal of the ACM, Volume 7, 201-215, 1960.
2. K. A. De Jong and W. M. Spears. Using Genetic Algorithms to Solve NPComplete Problems. In J. D. Schaffer (ed.), Proceedings of the Third International Conference on Genetic Algorithms, 124-132, Morgan Kaufmann Publishers, San Mateo, CA, 1989.
3. A. E. Eiben and J. K. van der Hauw. Graph Coloring with Adaptive Genetic Algorithms. Technical Report 96-11, Department of Computer Science, Leiden University, 1996.
4. A. E. Eiben and J. K. van der Hauw. Solving 3-SAT with Adaptive Genetic Algorithms. In Proceedings of the 4th IEEE Conference on Evolutionary Computation, 81-86, IEEE Service Center, Piscataway, N J, 1997.
5. C. Fleurent and J. A. Ferland. Object-oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique and Satisfiability. In D. S. Johnson and M. A. Trick (eds.), Cliques, Coloring and Satisfiability: 2nd DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 26, 619-652, 1996.
6. J. Frank. A Study of Genetic Algorithms to Find Approximate Solutions to Hard 3CNF Problems. Golden West International Conference on Artificial Intelligence, 1994.
7. J. Frank. Weighting for Godot: Learning Heuristics for GSAT. In Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, 338-343, 1996.
8. J. Frank. Learning Short-Term Weights for GSAT. Submitted to 15th International Joint Conference on Artificial Intelligence, 1997.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory ofNP-Completeness. W. H. Freeman, San Francisco, CA, 1979.
10. J. Gu. Global Optimization for Satisfiability (SAT) Problem. IEEE Transactions on Knowledge and Data Engineering, Volume 6, Number 3, 361-381, 1994.
11. J.-K. Hao. A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems. In D. W. Pearson, N. C. Steele, and R. F. Albrecht (eds.), Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, 289-292, Springer, Wien, 1995.
12. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Third Edition, Springer, 1996.
13. D. Mitchell, B. Selman, and H. Levesque. Hard and Easy Distributions of SAT Problems. In Proceedings of the lOth National Conference on Artificial Intelligence, 459-465, 1992.
14. K. Park. A Comparative Study of Genetic Search. In L. J. Eshelman (ed.), Proceedings of the Sixth International Conference on Genetic Algorithms, 512-519, Morgan Kaufmann, San Mateo, CA, 1995.
15. B. Selman, H. A. Kautz, and B. Cohen. Noise Strategies for Improving Local Search. In Proceedings of the 12th National Conference on Artificial Intelligence, 337-343, 1994.
16. B. Selman, H. Levesque, and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. In Proceedings of the l0th National Conference on Artificial Intelligence, 440-446, 1992.