Grammar based function definition in Grammatical Evolution

We describe the use of grammars as an approach to automatic function definition in Grammatical Evolution. The automatic generation of functions allows the evolution of both the function and the code belonging to the main body of the program which has the ability to call upon the evolving function. As proof of concept we apply a grammar using automatic function definition to the Santa Fe ant trail. Results show that the evolutionary search successfully evolves code for the automatically defined function and calls upon this function from the main code to generate solutions to the Santa Fe trail. An analysis of the number of successful runs shows a speed-up in terms of the number of generations required to find a solution when compared to standard Grammatical Evolution.

[1]  Michael O'Neill,et al.  Evolving Multi-line Compilable C Programs , 1999, EuroGP.

[2]  Justinian P. Rosca,et al.  An Analysis of Hierarchical Genetic Programming , 1995 .

[3]  Pierre Dupont,et al.  Regular Grammatical Inference from Positive and Negative Samples by Genetic Search: the GIG Method , 1994, ICGI.

[4]  Jordan B. Pollack,et al.  A Stochastic Search Approach to Grammar Induction , 1998, ICGI.

[5]  Stefano Cagnoni,et al.  A Cellular-Programming Approach to Pattern Classification , 1998, EuroGP.

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

[7]  Michael O'Neill,et al.  Under the hood of grammatical evolution , 1999 .

[8]  Marc Richetin,et al.  Efficient regular grammatical inference for pattern recognition , 1984, Pattern Recognit..

[9]  Rajesh Parekh,et al.  An Incremental Interactive Algorithm for Regular Grammar Inference , 1996, AAAI/IAAI, Vol. 2.

[10]  J. Pollack,et al.  The Evolutionary Induction of Subroutines , 1997 .

[11]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[12]  Luca Lombardi,et al.  Image classification: an evolutionary approach , 2002, Pattern Recognit. Lett..

[13]  Michael O'Neill,et al.  Crossover in Grammatical Evolution: A Smooth Operator? , 2000, EuroGP.

[14]  Michael O'Neill,et al.  Grammatical Evolution: Evolving Programs for an Arbitrary Language , 1998, EuroGP.

[15]  Pierre Dupont,et al.  Using Symbol Clustering to Improve Probabilistic Automaton Inference , 1998, ICGI.

[16]  Michael O'Neill,et al.  Grammatical Evolution: Solving Trigonometric Identities , 1998 .

[17]  Michael O'Neill,et al.  Genetic Code Degeneracy: Implications for Grammatical , 1999, ECAL.

[18]  Richard K. Belew,et al.  Stochastic Context-Free Grammar Induction with a Genetic Algorithm Using Local Search , 1996, FOGA.

[19]  Francisco Casacuberta,et al.  Local Languages, the Succesor Method, and a Step Towards a General Methodology for the Inference of Regular Grammars , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Emin Erkan Korkmaz,et al.  Genetic Programming for Grammar Induction , 2001 .

[21]  J. K. Kinnear,et al.  Alternatives in automatic function definition: a comparison of performance , 1994 .

[22]  Tao Jiang,et al.  Learning regular languages from counterexamples , 1988, COLT '88.

[23]  J. Oncina,et al.  INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME , 1992 .

[24]  W. B. Langdon,et al.  Genetic Programming and Data Structures , 1998, The Springer International Series in Engineering and Computer Science.

[25]  Stephen H. Unger.  A global parser for context-free phrase structure grammars , 1968, CACM.

[26]  S. Pinker.  Formal models of language learning , 1979, Cognition.

[27]  Wolfgang Banzhaf,et al.  A comparison of linear genetic programming and neural networks in medical data mining , 2001, IEEE Trans. Evol. Comput..

[28]  T. Jukes,et al.  The neutral theory of molecular evolution. , 2000, Genetics.

[29]  Encarna Segarra,et al.  On the Use of the Morphic Generator Grammatical Inference (MGGI) Methodology in Automatic speech Recognition , 1990, Int. J. Pattern Recognit. Artif. Intell..

[30]  Wolfgang Banzhaf,et al.  Genotype-Phenotype-Mapping and Neutral Variation - A Case Study in Genetic Programming , 1994, PPSN.

[31]  Dana Angluin,et al.  Inference of Reversible Languages , 1982, JACM.

[32]  Pedro García,et al.  IDENTIFYING REGULAR LANGUAGES IN POLYNOMIAL TIME , 1993 .

[33]  John R. Koza,et al.  Genetic programming 2 - automatic discovery of reusable programs , 1994, Complex Adaptive Systems.

[34]  Enrique Vidal,et al.  Inference of k-Testable Languages in the Strict Sense and Application to Syntactic Pattern Recognition , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[35]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[36]  R. M. Wharton.  Grammar Enumeration and Inference , 1977, Inf. Control..

[37]  Pierre Dupont,et al.  Incremental regular inference , 1996, ICGI.