Grammatical evolution: Evolving programs for an arbitrary language

Conor Ryan, J. J. Collins, Michael O’Neill

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We describe a Genetic Algorithm that can evolve complete programs. Using a variable length linear genome to govern how a Backus Naur Form grammar definition is mapped to a program, expressions and programs of arbitrary complexity may be evolved. Other automatic programming methods are described, before our system, Grammatical Evolution, is applied to a symbolic regression problem.

Original languageEnglish
Title of host publicationGenetic Programming - 1st European Workshop, EuroGP 1998, Proceedings
EditorsWolfgang Banzhaf, Terence C. Fogarty, Riccardo Poli, Marc Schoenauer
PublisherSpringer Verlag
Pages83-96
Number of pages14
ISBN (Print)3540643605, 9783540643609
DOIs
Publication statusPublished - 1998
Event1st European Workshop on Genetic Programming, EuroGP 1998 - Paris, France
Duration: 14 Apr 199815 Apr 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1391
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st European Workshop on Genetic Programming, EuroGP 1998
Country/TerritoryFrance
CityParis
Period14/04/9815/04/98

Fingerprint

Dive into the research topics of 'Grammatical evolution: Evolving programs for an arbitrary language'. Together they form a unique fingerprint.

Cite this