Christiansen Grammar Evolution: Grammatical Evolution With Semantics

Author

Ortega, Alfonso ; De la Cruz, Marina ; Alfonseca, Manuel

Author_Institution

Departamento de Ingenieria Informatica, Univ. Autonoma de Madrid

Volume

11

Issue

1

fYear

2007

Firstpage

77

Lastpage

90

Abstract

This paper describes Christiansen grammar evolution (CGE), a new evolutionary automatic programming algorithm that extends standard grammar evolution (GE) by replacing context-free grammars by Christiansen grammars. GE only takes into account syntactic restrictions to generate valid individuals. CGE adds semantics to ensure that both semantically and syntactically valid individuals are generated. It is empirically shown that our approach improves GE performance and even allows the solution of some problems are difficult to tackle by GE

Keywords

context-free grammars; evolutionary computation; formal languages; programming language semantics; Christiansen grammar evolution; context-free grammars; evolutionary automatic programming algorithm; formal language; grammatical evolution; semantics; Automata; Automatic programming; Computer languages; Computer science; Educational programs; Formal languages; Genetic algorithms; Helium; Program processors; Turing machines; Automatic programming; formal languages; genetic algorithms (GAs); languages;

fLanguage

English

Journal_Title

Evolutionary Computation, IEEE Transactions on

Publisher

ieee

ISSN

1089-778X

Type

jour

DOI

10.1109/TEVC.2006.880327

Filename

4079617