Changes between Version 17 and Version 18 of Documentation/Reference/GPDL
 Timestamp:
 07/08/13 19:23:45 (9 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Documentation/Reference/GPDL
v17 v18 3 3 gkronber@heuristiclab.com 4 4 5 The aim of GPDL is to make it easier to use GPsystems. Currently, it is very cumbersome to implement new problems in GPsystems, because several factors which includeamong others:6 * a lot of boilerplate code has to be written to integrate into the GP framework .7 * it is necessary to learn the API of the GP system8 * problem implementations cannot be reused to try different GP systems (e.g. ECJ, HeuristicLab, ...)5 The aim of GPDL is to make it easier to use GPsystems. Currently, it is very cumbersome to implement new problems in GPsystems, because of several factors including among others: 6 * a lot of boilerplate code has to be written to integrate into the GP framework, 7 * it is necessary to learn APIs of different GP system, 8 * problem implementations cannot be reused to try different GP systems (e.g. ECJ, HeuristicLab, GEVA, JGAP, ...). 9 9 10 We argue that the uptake of GP for real world applications has only been limited so far, because it is difficult to use the available highquality implementations of GPand it takes a lot of time to implement more complex GP problems.10 We argue, that the uptake of GP for real world applications has only been limited so far, because it is difficult to use the available highquality implementations of GP, and it takes a lot of time to implement more complex GP problems. 11 11 12 GPDL separates the implementation of problem details from the intricacies of algorithm implementations. Only the details of the problem are specified in a frameworkindependent way. A compiler can transform the problem description to source code for different GP systems. This way, it will be much easier to implement problems and t ry to solve them withdifferent GP implementations or even other kinds of solvers!12 GPDL separates the implementation of problem details from the intricacies of algorithm implementations. Only the details of the problem are specified in a frameworkindependent way. A compiler can transform the problem description to source code for different GP systems. This way, it will be much easier to implement problems and to use different GP implementations or even other kinds of solvers! 13 13 14 GPDL is not limited to C# or Java and it is not limited to HeuristicLab (however, it is the only system we implemented a compiler for so far).14 GPDL is based on the concept of attributed grammars with semantic actions that are usually used in compiler construction. Basically, GP can be described as search over a space of sentences of a formal language. The goal is to find a sentence with optimal objective function value. Therefore, a GP problem can be defined as a tuple of a formal language, defined e.g. via a grammar, and an objective function for sentences. Therefore, our idea is to specify GP problems via an attributed grammar with semantic actions for the interpretation of sentences, and an objective function to be minimized or maximized. Below, you will find an example for the definition of a symbolic regression problem in GPDL. 15 15 16 GPDL is based on the concept of attributed grammars with semantic actions that are usually used in compiler construction. Basically, GP can be described as search over a space of sentences of a formal language to find the sentence with optimal objective function value. Therefore, a GP problem can be defined as a tuple of a formal language, defined e.g. via a grammar, and an objective function for sentences. Therefore, our idea is to specify GP problems via an attributed grammar with semantic actions for the interpretation of sentences and an objective function to be minimized / maximized. Below you will find an example how the symbolic regression model can be in GPDL.16 GPDL is not limited to C# or Java, and it is not limited to HeuristicLab (however, it is the only system we implemented a compiler for so far). 17 17 18 18 On this page we provide a first specification of the GPDL language and a reference implementation for a GPDL compiler for HeuristicLab.