文档介绍：Evolving Recursive Programs by Using Adaptive Grammar Based ic
Programming
Man Leung Wong
Department puting and Decision Sciences
Lingnan University
Tuen Mun
Hong Kong
******@
Abstract
ic programming (GP) extends traditional ic algorithms to automatically induce
computer programs. GP has been applied in a wide range of applications such as software re-
engineering, electrical circuits synthesis, knowledge engineering, and data mining. One of the
most important and challenging research areas in GP is the investigation of ways to essfully
evolve recursive programs. A recursive program is one that calls itself either directly or
indirectly through other programs. Because recursions lead pact and general programs
and provide a mechanism for reusing program code, they facilitate GP to solve larger and more
complicated problems. Nevertheless, it monly agreed that the recursive program learning
problem is very difficult for GP. In this paper, we propose techniques to tackle the difficulties in
learning recursive programs. The techniques are incorporated into an adaptive Grammar Based
ic Programming system (adaptive GBGP). A number of experiments have been performed
to demonstrate that the system improves the effectiveness and efficiency in evolving recursive
programs.
Keywords: Grammar Based ic Programming, Logic Grammars, Recursive Programs
Page 1
1. Introduction
ic programming (GP) extends traditional ic algorithms (Holland 1975, Goldberg
1989) to automatically puter programs (Koza 1992; 1994, Koza et al. 1999; 2003). It
is a stochastic general search and problem solving method that uses the analogies from natural
selection and evolution. GP encodes potential solutions to a specific problem puter
programs and apply reproduction and bination operators to these programs to create new
programs. The reproduction and bination processes are repeated until appropriate
solution