Learning programs in different paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to parse trees. Hence, GP should be able to handle them as well. In practice, the syntax of Lisp is so simple and uniform that the translation process can be achieved easily, programs evolved by GP are usually expressed in Lisp. This paper presents a flexible framework that programs in various programming languages can be acquired. This framework is based on a formalism of logic grammars. To implement the framework, a system called LOGENPRO (The LOgic grammar based GENetic PROgramming system) has been developed. An experiment that employs LOGENPRO to induce a S-expression for calculating dot product has been performed. This experiment illustrates that LOGENPRO, when used with knowledge of data types, accelerates the learning of programs. Other experiments have been done to illustrate the ability of LOGENPRO in inducing programs in difference programming languages including Prolog and C. These experiments prove that LOGENPRO is very flexible.
- DeJong, K. A., Spears, W. M. and Gordon, D. F. (1993). Using Genetic Algorithms for Concept Learning, Machine Learning, 13, 161–188.
- Goldberg, D. E. (1989) Genetic Algorithms in Search, Optimization, and Machine Learning. MA: Addison-Wesley.
- Janikow, C. Z. (1993). A Knowledge-Intensive Genetic Algorithm for Supervised Learning, Machine Learning, 13, 189–228.
- Koza, J. R. (1992). Genetic Programming: on the Programming of Computers by Means of Natural Selection. MA: MIT Press.
- Koza, J. R. (1994). Genetic Programming II: Automatic Discovery of Reusable Programs. Cambridge, MA: MIT Press.
- Montana, D. J. (1993). Strongly Typed Genetic Programming. Bolt, Beranek, and Newman Technical Report no. 7866.
- Pazzani, M. and Kibler, D. (1992). The Utility of Knowledge in Inductive learning. Machine Learning, 9, pp. 57–94.
- Pereira, F. C. N. and Warren, D. H. D. (1980). Definite Clause Grammars for Language Analysis — A Survey of the Formalism and a Comparison with Augmented Transition Networks. Artificial Intelligence; 13, pp. 231–278.
- Quinlan, J. R. (1990). Learning logical definitions from relations. Machine Learning, 5, 239–266.
- Learning programs in different paradigms using Genetic Programming
- Book Title
- Topics in Artificial Intelligence
- Book Subtitle
- 4th Congress of the Italian Association for Artificial Intelligence AI*IA '95 Florence, Italy, October 11–13, 1995 Proceedings
- pp 353-364
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series Subtitle
- Lecture Notes in Artificial Intelligence
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.