Changes between Version 13 and Version 14 of Documentation/Reference/GPDL

Timestamp:

07/08/13 15:23:53 (7 years ago)

Author:

gkronber

Comment:

--

Documentation/Reference/GPDL

@@ -1 @@
-= Genetic Programming Problem Definition Language =
+= Genetic Programming Problem Definition Language (GPDL) =
 [[http://heal.heuristiclab.com/team/kronberger | Gabriel Kronberger]], last update 8th of July, 2013
 
-The aim of GPDL is to make it easier to use GP-systems. Right now, it is very cumbersome to implement new problems in GP-systems. Several factors limit the usefulness of existing GP implementations:
+The aim of GPDL is to make it easier to use GP-systems. Currently, it is very cumbersome to implement new problems in GP-systems because several factors limit the usefulness of existing GP implementations which include among others:
  * a lot of boiler-plate code has to be written to integrate into the GP framework. 
  * it is necessary to learn the API of the GP system
  * problem implementations cannot be re-used to try different GP systems (e.g. ECJ, HeuristicLab, ...)
 
-GPDL separates the implementation of problem details from the intricacies of algorithm implementations. Only the details of the problem are specified in a framework-independent 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 try to solve them with different GP implementations or even other kinds of solvers!
+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 high-quality implementations of GP.
+
+GPDL separates the implementation of problem details from the intricacies of algorithm implementations. Only the details of the problem are specified in a framework-independent 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 try to solve them with different GP implementations or even other kinds of solvers!
 
 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).
 
 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.
-
 
 On this page we provide a first specification of the GPDL language and a reference implementation for a GPDL compiler for HeuristicLab.