Canonical representation genetic programming
Created by W.Langdon from
gpbibliography.bib Revision:1.5327
 @InProceedings{WoodwardB:2009:GEC,

author = "John R. Woodward and Ruibin Bai",

title = "Canonical representation genetic programming",

booktitle = "GEC '09: Proceedings of the first ACM/SIGEVO Summit on
Genetic and Evolutionary Computation",

year = "2009",

editor = "Lihong Xu and Erik D. Goodman and Guoliang Chen and
Darrell Whitley and Yongsheng Ding",

bibsource = "DBLP, http://dblp.unitrier.de",

pages = "585592",

address = "Shanghai, China",

organisation = "SigEvo",

URL = "http://www.cs.nott.ac.uk/~jrw/publications/canonical.pdf",

DOI = "doi:10.1145/1543834.1543914",

publisher = "ACM",

publisher_address = "New York, NY, USA",

month = jun # " 1214",

isbn13 = "9781605583266",

keywords = "genetic algorithms, genetic programming, No Free Lunch
Theorem (NFL), canonical representation, standard form,
evolutionary computation, bias, symmetric functions,
inverse functions, complementary functions, isomorphic
representations",

size = "8 pages",

abstract = "Search spaces sampled by the process of Genetic
Programming often consist of programs which can
represent a function in many different ways. Thus, when
the space is examined it is highly likely that
different programs may be tested which represent the
same function, which is an undesirable waste of
resources. It is argued that, if a search space can be
constructed where only unique representations of a
function are permitted, then this will be more
successful than employing multiple representations.
When the search space consists of canonical
representations it is called a canonical search space,
and when Genetic Programming is applied to this search
space, it is called Canonical Representation Genetic
Programming. The challenge lies in constructing these
search spaces. With some function sets this is a
trivial task, and with some function sets this is
impossible to achieve. With other function sets it is
not clear how the goal can be achieved. In this paper,
we specifically examine the search space defined by the
function set {+,,*,/} and the terminal set {x, 1}.
Drawing inspiration from the fundamental theorem of
arithmetic, and results regarding the fundamental
theorem of algebra, we construct a representation where
each function that can be constructed with this
primitive set has a unique representation.",

notes = "
best paper in conference.
http://tech.groups.yahoo.com/group/genetic_programming/message/5687
Also known as \cite{DBLP:conf/gecco/WoodwardB09} part
of \cite{DBLP:conf/gec/2009}",
 }
Genetic Programming entries for
John R Woodward
Ruibin Bai
Citations