de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Book Chapter

Solving Satisfiability Problems with Genetic Algorithms

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons83954

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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: http://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.