 |
    |
An Encoding Scheme for Generating 
-Expressions in Genetic Programming
Kazuto Tominaga, Tomoya Suzuki, and Kazuhiro Oka
Tokyo University of Technology
Hachioji
Tokyo 192-0982 Japan
tomi@acm.org
{tomoya,oka}@ns.it.teu.ac.jp
Abstract.
To apply genetic programming (GP) to evolve
-expressions, we devised an encoding scheme that
encodes -expressions into trees. This encoding has
closure property, i.e., any combination of terminal and
non-terminal symbols forms a valid -expression. We
applied this encoding to a simple symbolic regression problem over
Church numerals and the objective function 
was
successfully obtained. This encoding scheme will provide a good
foothold for exploring fundamental properties of GP by making use
of lambda-calculus.
LNCS 2724, p. 1814 ff.
lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2003