GPDL: a framework-independent problem definition language for grammar-guided genetic programming

Authors:
Gabriel Kronberger;Michael Kommenda;Stefan Wagner;Heinz Dobler
Affiliations:
University of Applied Sciences Upper Austria, Hagenberg, Austria;University of Applied Sciences Upper Austria, Hagenberg, Austria;University of Applied Sciences Upper Austria, Hagenberg, Austria;University of Applied Sciences Upper Austria, Hagenberg, Austria
Venue:
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Year:
2013

Citing 10
Cited 0

Top-down parsing in Coco-2

ACM SIGPLAN Notices
Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Grammatically biased learning: learning logic programs using an explicit antecedent description language

Artificial Intelligence
Coco-2: a new compiler compiler

ACM SIGPLAN Notices
Logic-based genetic programming with definite clause translation grammars

New Generation Computing
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language

Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Latent variable model for estimation of distribution algorithm based on a probabilistic context-free grammar

IEEE Transactions on Evolutionary Computation
Grammar-based Genetic Programming: a survey

Genetic Programming and Evolvable Machines
The Automatic Acquisition, Evolution and Reuse of Modules in Cartesian Genetic Programming

IEEE Transactions on Evolutionary Computation
On the architecture and implementation of tree-based genetic programming in HeuristicLab

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Defining custom problem types in genetic programming (GP) software systems is a tedious task that usually involves the implementation of custom classes and methods including framework-specific code. Users who want to solve a custom problem have to know the details of the targeted framework, for instance cloning semantics, and often have to write a lot of boilerplate code in order to implement the necessary functionality correctly. This can lead to frustration and hinders new developments and the application of GP to solve interesting problems. In this contribution we propose a framework-independent definition language for GP problems that can reduce the required effort and facilitate the integration of new problem types. We draw a parallel between the implementation of compilers for programming languages and the implementation of GP problems and reuse the well-established concept of attributed grammars with semantic actions to define computational symbols, semantics and structural constraints for GP. This goes beyond previous work in the area of context-free-grammar GP and grammatical evolution, because we also interweave the definition of symbol semantics and the target function with the definition of the grammar. This paper describes the proposed GP problem definition language (GPDL) and exemplary definitions of two popular benchmark problems using GPDL. We also describe a reference implementation of a GPDL compiler for HeuristicLab.