Adaptable Grammars for Non-Context-Free Languages
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Towards the validation of plagiarism detection tools by means of grammar evolution
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Grammar-based Genetic Programming: a survey
Genetic Programming and Evolvable Machines
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Towards the automatic programming of NEPs
IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation - Volume Part I
Evolving high-level imperative program trees with strongly formed genetic programming
EuroGP'12 Proceedings of the 15th European conference on Genetic Programming
Sensitive ants are sensible ants
Proceedings of the 14th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
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