Extending Program Synthesis Grammars for Grammar-Guided Genetic Programming

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

  author =       "Stefan Forstenlechner and David Fagan and 
                 Miguel Nicolau and Michael O'Neill",
  title =        "Extending Program Synthesis Grammars for
                 Grammar-Guided Genetic Programming",
  booktitle =    "15th International Conference on Parallel Problem
                 Solving from Nature",
  year =         "2018",
  editor =       "Anne Auger and Carlos M. Fonseca and Nuno Lourenco and 
                 Penousal Machado and Luis Paquete and Darrell Whitley",
  volume =       "11101",
  series =       "LNCS",
  pages =        "197--208",
  address =      "Coimbra, Portugal",
  month =        "8-12 " # sep,
  publisher =    "Springer",
  keywords =     "genetic algorithms, genetic programming, Grammar,
                 Program synthesis",
  isbn13 =       "978-3-319-99252-5",
  URL =          "https://www.springer.com/gp/book/9783319992587",
  DOI =          "doi:10.1007/978-3-319-99253-2_16",
  abstract =     "Program synthesis is a problem domain that due to its
                 importance is tackled by many different fields, one
                 being Genetic Programming. Two variants, Grammar-Guided
                 Genetic Programming (G3P) and PushGP, have been applied
                 to a vast general program synthesis benchmark suite and
                 solved a variety of problems although with varying
                 success rates. While G3P achieved higher success rates
                 on some problems, PushGP was able to find solutions to
                 more problem instances. Reason why G3P fails at some
                 problems might be missing functionality in the grammars
                 or knowledge that has to discovered during the runs. In
                 this paper the current shortcomings of G3P are analysed
                 and the papers contributions include an example of
                 extending grammars for program synthesis, a fairer
                 comparison between PushGP and G3P with a more similar
                 function set as well as new results on problems that
                 have not been solved with G3P and one that has not been
                 solved with PushGP.",
  notes =        "PPSN2018 http://ppsn2018.dei.uc.pt

                 This two-volume set LNCS 11101 and 11102 constitutes
                 the refereed proceedings of the 15th International
                 Conference on Parallel Problem Solving from Nature,
                 PPSN 2018",

Genetic Programming entries for Stefan Forstenlechner David Fagan Miguel Nicolau Michael O'Neill