Return to search

Evoluční algoritmy v úloze booleovské splnitelnosti / Evolutionary Algorithms in the Task of Boolean Satisfiability

The goal of this Master's Thesis is finding a SAT solving heuristic by the application of an evolutionary algorithm. This thesis surveys various approaches used in SAT solving and some variants of evolutionary algorithms that are relevant to this topic. Afterwards the implementation of a linear genetic programming system that searches for a suitable heuristic for SAT problem instances is described, together with the implementation of a custom SAT solver which expoloits the output of the genetic program. Finally, the achieved results are summarized.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:236224
Date January 2013
CreatorsSerédi, Silvester
ContributorsVašíček, Zdeněk, Sekanina, Lukáš
PublisherVysoké učení technické v Brně. Fakulta informačních technologií
Source SetsCzech ETDs
LanguageCzech
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.0015 seconds