论文信息 - Grammatical Evolution: Evolving Programs for an Arbitrary Language

Grammatical Evolution: Evolving Programs for an Arbitrary Language

We describe a Genetic Algorithm that can evolve complete programs. Using a variable length linear genome to govern how a Backus Naur Form grammar definition is mapped to a program, expressions and programs of arbitrary complexity may be evolved. Other automatic programming methods are described, before our system, Grammatical Evolution, is applied to a symbolic regression problem.

[1] Kalyanmoy Deb,et al. Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[2] Gerald D. Elseth,et al. Principles of Modern Genetics , 1995 .

[3] Kwong-Sak Leung,et al. Applying logic grammars to induce sub-functions in genetic programming , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[4] Peter A. Whigham. Inductive bias and genetic programming , 1995 .

[5] W. Banzhaf,et al. Genetic programming using genotype-phenotype mapping from linear genomes into linear phenotypes , 1996 .

[6] Peter A. Whigham,et al. Search bias, language bias and genetic programming , 1996 .

[7] Mike Livesey,et al. Evolving caching algorithms in C by genetic programming , 1997 .

[8] Vidroha Debroy,et al. Genetic Programming , 1998, Lecture Notes in Computer Science.

[9] Una-May O'Reilly. The Impact of External Dependency in Genetic Programming Primitives , 1998, Canadian Conference on AI.