Abstract
Genetic Programming (GP) is a powerful software induction technique that has been recently applied for solving a wide variety of problems. Attempts to extend GP have focussed on applying type restrictions to the language to control genetic operators and to ensure that only valid programs are created. In this sense, the use of context free grammar (CFG) was proposed. This work studies the use of a CFG to define the structure of the initial population and direct crossover and mutation operators. Chameleon, a Grammar-Guided Genetic Programming system (GGGP) is also presented. On a suite of experiments composed of even-parity problems, the performance of Chameleon is compared to traditional GP. Furthermore, the automatic discovery of sub-functions, one of the most important research areas in GP, is also explored. We describe how to use ADFs with GGGP and, using Chameleon, we demonstrate that GGGP has similar results to Koza’s Automatically Defined Functions (ADF) approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Koza, J. R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press, Cambridge, MA (1992)
Koza, J. R.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge, MA (1994)
Banzhaf, W.; Nordin, P.; Keller, R. E.; Franconi, F. D.: Genetic Programming-an introduction. Morgan Kaufmann, San Francisco, CA (1998)
Whigham, P. A.: Grammatically based Genetic Programming. In: Proceedings of ML’95 Workshop on Genetic Programming-From Theory to Real-Word Applications. Lake Tahoe, CA (1995) 33–41
O’Neil, M.; Ryan, C.: Grammar based Function Definition in Grammatical Evolution. In: Genetic Programming 2000: Proceedings of the 5th Annual Conference, MIT Press (2000) 485–490
Ratle, A.; Sebag, M.: Genetic Programming and Domain Knowledge: beyond the limitations of grammar-guided machine discovery. In: Proceedings of the Sixth Conference on Parallel Problem Solving from Nature, LNCS, Springer, Berlin (2000) 211–220
O’Reilly, U.: An Analysis of Genetic Programming. PhD thesis. Ottawa Carleton Institute for Computer Science (1995)
Cohen. P. R.: Empirical Methods for Artificial Intelligence. MIT Press, Cambridge, MA (1995)
Gruau, F.: On Using Syntatic Constraints with Genetic Programming. In: Advances in Genetic Programming, MIT Press (1996) 377–394
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodrigues, E., Pozo, A. (2002). Grammar-Guided Genetic Programming and Automatically Defined Functions. In: Bittencourt, G., Ramalho, G.L. (eds) Advances in Artificial Intelligence. SBIA 2002. Lecture Notes in Computer Science(), vol 2507. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36127-8_31
Download citation
DOI: https://doi.org/10.1007/3-540-36127-8_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00124-9
Online ISBN: 978-3-540-36127-5
eBook Packages: Springer Book Archive