Type Inheritance in Strongly Typed Genetic Programming   [ST] [GP]

by

Haynes, T., D., Schoenefeld, D., A. and Wainwright, R., L.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Advances in Genetic Programming 2, 1996, p. 359-376
Keywords:genetic algorithms, genetic programming
Abstract:
Genetic Programming (GP) [GP] is an automatic method for generating computer programs, which are stored as data structures [DS] and manipulated to evolve better programs. An extension restricting the search space [SS] is Strongly Typed Genetic Programming (STGP), [ST] [GP] which has, as a basic premise, the removal of closure by typing both the 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 a type hierarchy, which allows more than two levels of typing.
URL(s):Postscript
(G)zipped postscript

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InCollection{haynes:1996:aigp2,
  author =       "Thomas D. Haynes and Dale A. Schoenefeld and Roger L.
                 Wainwright",
  title =        "Type Inheritance in Strongly Typed Genetic
                 Programming",
  booktitle =    "Advances in Genetic Programming 2",
  publisher =    "MIT Press",
  year =         "1996",
  editor =       "Peter J. Angeline and K. E. {Kinnear, Jr.}",
  pages =        "359--376",
  chapter =      "18",
  address =      "Cambridge, MA, USA",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "0-262-01158-1",
  URL =          "http://euler.mcs.utulsa.edu/~haynes/hier.ps",
  abstract =     "Genetic Programming (GP) is an automatic 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 both the
                 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 a type hierarchy, which allows more than two
                 levels of typing.",
}