Type Inheritance in Strongly Typed Genetic Programming
Thomas D. Haynes, Dale A. Schoenefeld, Roger L. Wainwright · The MIT Press eBooks · 1996
Genetic Programming (GP)isanautomatic method for generating computer programs, which are stored as data structures and manipulated to evolve better programs. An extension restricting the search space is Strongly Typed Genetic Programming (STGP), which has, as a basic premise, the removal of closure by typing boththe arguments and return values of functions, and by also typing the terminal set. A restriction of STGP is that there are only two levels of typing. We extend STGP by allowing atype hierarchy, which allows more than two levels of typing. 1