English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Book Chapter

Solving Satisfiability Problems with Genetic Algorithms

MPS-Authors
There are no MPG-Authors in the publication available
External Resource
Fulltext (public)

genetic_sat.pdf
(Any fulltext), 72KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Harmeling, S. (2000). Solving Satisfiability Problems with Genetic Algorithms. In J. Koza (Ed.), Genetic Algorithms and Genetic Programming at Stanford 2000: Book of Student Papers from John Koza's Course at Stanford on Genetic Algorithms and Genetic Programming (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.