Session:

GEWS - Grammatical Evolution

Title:

Syntactically Correct Genetic Programming

Authors:

Robert Vanyi
Szilvia Zvada

Abstract:

When common Genetic Programming is used to solve a problem, the so-called closure property must be fulfilled. That is any solution received by changing parse trees at any point has to be considered as a candidate and must receive a fitness value. Sometimespace into a smaller number of equivalence classes. This reduction allows easier computation of fixed points. The effect of model fixed points that are outside of the population space, but near enough to influence behavior of the Simple GA will be examined. This analysis will be applied to several fitness functions of unitation.