5 | | 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 of several factors including among others: |
6 | | * a lot of boiler-plate code has to be written to integrate into the GP framework, |
| 5 | The aim of GPDL is to make it easier to use |
| 6 | GP-systems. Currently, it is very cumbersome to implement new |
| 7 | problems in GP-systems, because of several factors including |
| 8 | among others: |
| 9 | * a lot of boiler-plate code has to be written to integrate into |
| 10 | the GP framework, |
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 high-quality implementations of GP, and it takes a lot of time to implement more complex GP problems. |
| 15 | We argue, that the uptake of GP for real world applications has |
| 16 | only been limited so far, because it is difficult to use the |
| 17 | available high-quality implementations of GP, and it takes a lot |
| 18 | of time to implement more complex GP problems. |
12 | | 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 to use different GP implementations or even other kinds of solvers! |
| 20 | GPDL separates the implementation of problem details from the |
| 21 | intricacies of algorithm implementations. Only the details of the |
| 22 | problem are specified in a framework-independent way. A compiler |
| 23 | can transform the problem description to source code for |
| 24 | different GP systems. This way, it will be much easier to |
| 25 | implement problems and to use different GP implementations or |
| 26 | even other kinds of solvers! |
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. |
| 28 | GPDL is based on the concept of attributed grammars with semantic |
| 29 | actions that are usually used in compiler |
| 30 | construction. Basically, GP can be described as search over a |
| 31 | space of sentences of a formal language. The goal is to find a |
| 32 | sentence with optimal objective function value. Therefore, a GP |
| 33 | problem can be defined as a tuple of a formal language, defined |
| 34 | e.g. via a grammar, and an objective function for |
| 35 | sentences. Therefore, our idea is to specify GP problems via an |
| 36 | attributed grammar with semantic actions for the interpretation |
| 37 | of sentences, and an objective function to be minimized or |
| 38 | maximized. Below, you will find an example for the definition of |
| 39 | a symbolic regression problem in GPDL. |