Solving Satisfiability Problems with Genetic Algorithms

Harmeling, S; Koza, J. R.

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1793497_2

DetailsSummary

Released

Book Chapter

Solving Satisfiability Problems with Genetic Algorithms

MPS-Authors

/persons/resource/persons83954

Harmeling, S
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Harmeling, S. (2000). Solving Satisfiability Problems with Genetic Algorithms. In Genetic Algorithms and Genetic Programming at Stanford 2000 (pp. 206-213). Stanford, CA, USA: Stanford Bookstore.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-E4D4-5

Abstract

We show how to solve hard 3-SAT problems using genetic algorithms. Furthermore, we explore other genetic operators that may be useful to tackle 3-SAT problems, and discuss their pros and cons.