@brazovayeye

An Encoding Scheme for Generating -Expressions in Genetic Programming

, , and . Genetic and Evolutionary Computation -- GECCO-2003, volume 2724 of LNCS, page 1814--1815. Chicago, Springer-Verlag, (12-16 July 2003)

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.

Links and resources

Tags