Grammar-based Genetic Programming: a survey

  • Authors:

  • Robert I. Mckay;Nguyen Xuan Hoai;Peter Alexander Whigham;Yin Shan;Michael O'Neill

  • Affiliations:

  • Structural Complexity Lab, School of Computer Science and Engineering, Seoul National University, Seoul, Korea;Department of Computer Science, Le Quy Don University, Hanoi, Vietnam;Department of Information Science, University of Otago, Dunedin, New Zealand;Medicare Australia, Canberra, Australia;Complex and Adaptive Systems Lab, School of Computer Science and Informatics, University College Dublin, Dublin, Ireland

  • Venue:
  • Genetic Programming and Evolvable Machines
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Grammar formalisms are one of the key representation structures in Computer Science. So it is not surprising that they have also become important as a method for formalizing constraints in Genetic Programming (GP). Practical grammar-based GP systems first appeared in the mid 1990s, and have subsequently become an important strand in GP research and applications. We trace their subsequent rise, surveying the various grammar-based formalisms that have been used in GP and discussing the contributions they have made to the progress of GP. We illustrate these contributions with a range of applications of grammar-based GP, showing how grammar formalisms contributed to the solutions of these problems. We briefly discuss the likely future development of grammar-based GP systems, and conclude with a brief summary of the field.