2004
DOI: 10.1007/978-3-540-24650-3_13
|View full text |Cite
|
Sign up to set email alerts
|

Grammatical Evolution by Grammatical Evolution: The Evolution of Grammar and Genetic Code

Abstract: Abstract. This study examines the possibility of evolving the grammar that Grammatical Evolution uses to specify the construction of a syntactically correct solution. As the grammar dictates the space of symbols that can be used in a solution, its evolution represents the evolution of the genetic code itself. Results provide evidence to show that the coevolution of grammar and genetic code with a solution using grammatical evolution is a viable approach.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
44
0

Year Published

2006
2006
2016
2016

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 50 publications
(45 citation statements)
references
References 11 publications
1
44
0
Order By: Relevance
“…on the phenotype [70], alternatives to the MOD rule in genotype-phenotype translation [45], an alternative mapping process that evolves the order in which nonterminals are expanded in addition to how they are expanded [65], different search strategies [73,64,63], new representations based on the GE representation aiming to reduce the effects of positional dependence [87], implementation of GAs through GE using an attribute grammar [86], the use of a meta-grammar with GE to improve its evolvability [69] and to implement a GA [62,29]. Harper and Blair [27] showed how to use grammars to dynamically define functions, obviating the need for special-purpose mechanisms such as Automatically Defined Functions [48].…”
Section: Linearised Gggpmentioning
confidence: 99%
See 1 more Smart Citation
“…on the phenotype [70], alternatives to the MOD rule in genotype-phenotype translation [45], an alternative mapping process that evolves the order in which nonterminals are expanded in addition to how they are expanded [65], different search strategies [73,64,63], new representations based on the GE representation aiming to reduce the effects of positional dependence [87], implementation of GAs through GE using an attribute grammar [86], the use of a meta-grammar with GE to improve its evolvability [69] and to implement a GA [62,29]. Harper and Blair [27] showed how to use grammars to dynamically define functions, obviating the need for special-purpose mechanisms such as Automatically Defined Functions [48].…”
Section: Linearised Gggpmentioning
confidence: 99%
“…It has received limited attention in GP, but three of the systems described here may be seen as learning hyperheuristics. Meta-GE uses a meta-grammar [69], which learns a grammar to describe solutions to an optimisation problem. GMPE [91] not only learns solutions to a problem, but also learns a grammar describing the solution space.…”
Section: Meta-evolutionmentioning
confidence: 99%
“…If we allowed this search to be rebalanced, will this confer an advantage. For example, it may be that the rate of search directed towards the order of the map should be undertaken at a lower rate than that of the content in order to give each evolved mapping order a chance to be sampled for a number of alternative content sets (c.f., genetic code [7] and grammar evolution [13], [5] mapping process. Consider the effect changing one of the order codons has on the mapping, compared to changing one content codon.…”
Section: N T To Expand = Codon Value % Number Of N T S (2)mentioning
confidence: 99%
“…The grammar-based Genetic Programming approach upon which this study is based is the Grammatical Evolution by Grammatical Evolution algorithm [5], which is in turn based on the Grammatical Evolution algorithm [6][7][8][9]. This is a meta-Grammar Evolutionary Algorithm in which the input grammar is used to specify the construction of another syntactically correct grammar.…”
Section: Grammatical Evolution By Grammatical Evolutionmentioning
confidence: 99%
“…All of this can be achieved through the adoption of meta-Grammars as were adopted earlier in [5]. An example of such a grammar for an 8-bit individual is given below.…”
Section: Meta-grammars For Bitstringsmentioning
confidence: 99%