Evolving Recursive Programs using Non-recursive Scaffolding

Created by W.Langdon from gp-bibliography.bib Revision:1.4549

  title =        "Evolving Recursive Programs using Non-recursive
  author =       "Alberto Moraglio and Fernando Otero and 
                 Colin Johnson and Simon Thompson and Alex Freitas",
  pages =        "2242--2249",
  booktitle =    "Proceedings of the 2012 IEEE Congress on Evolutionary
  year =         "2012",
  editor =       "Xiaodong Li",
  month =        "10-15 " # jun,
  URL =          "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=",
  URL =          "http://www.cs.kent.ac.uk/people/staff/aaf/pub_papers.dir/CEC-2012-Moraglio-Proc.pdf",
  DOI =          "doi:10.1109/CEC.2012.6256545",
  address =      "Brisbane, Australia",
  ISBN =         "0-7803-8515-2",
  keywords =     "genetic algorithms, genetic programming, grammar based
                 GP, scaffolding, CFG-GP",
  size =         "8 pages",
  abstract =     "Genetic programming has proved capable of evolving
                 solutions to a wide variety of problems. However, the
                 successes have largely been with programs without
                 iteration or recursion; evolving recursive programs has
                 turned out to be particularly challenging. The main
                 obstacle to evolving recursive programs seems to be
                 that they are particularly fragile to the application
                 of search operators: a small change in a correct
                 recursive program generally produces a completely wrong
                 program. In this paper, we present a simple and general
                 method that allows us to pass back and forth from a
                 recursive program to an equivalent non-recursive
                 program. Finding a recursive program can then be
                 reduced to evolving non-recursive programs followed by
                 converting the optimum non-recursive program found to
                 the equivalent recursive program. This avoids the
                 fragility problem above, as evolution does not search
                 the space of recursive programs. We present promising
                 experimental results on a test-bed of recursive
  notes =        "CFG-GP \cites{whigham:1995:GBGP} (STGP).

                 Cited by \cite{Bladek:2016:GECCOcomp}

                 WCCI 2012. CEC 2012 - A joint meeting of the IEEE, the
                 EPS and the IET.",

Genetic Programming entries for Alberto Moraglio Fernando Esteban Barril Otero Colin G Johnson Simon Thompson Alex Alves Freitas