%0 Journal Article %1 ross:2001:ngc %A Ross, Brian J. %D 2001 %J New Generation Computing %K Clause Computation, Definite Evolutionary Grammar, Inference Language Logic Programming, Prolog, Stochastic Translation algorithms, clause definite genetic grammars, programming, translation %N 4 %P 313--337 %T Logic-based Genetic Programming with Definite Clause Translation Grammars %U http://citeseer.ist.psu.edu/331862.html %V 19 %X DCTG-GP is a genetic programming system that uses definite clause translation grammars. A DCTG is a logical version of an attribute grammar that supports the definition of context--free languages, and it allows semantic information associated with a language to be easily accommodated by the grammar. This is useful in genetic programming for defining the interpreter of a target language, or incorporating both syntactic and semantic problem-specific constraints into the evolutionary search. The DCTG-GP system improves on other grammar-based GP systems by permitting non--trivial semantic aspects of the language to be defined with the grammar. It also automatically analyses grammar rules in order to determine their minimal depth and termination characteristics, which are required when generating random program trees of varied shapes and sizes. An application using DCTG-GP is described.

@article{ross:2001:ngc, abstract = {DCTG-GP is a genetic programming system that uses definite clause translation grammars. A DCTG is a logical version of an attribute grammar that supports the definition of context--free languages, and it allows semantic information associated with a language to be easily accommodated by the grammar. This is useful in genetic programming for defining the interpreter of a target language, or incorporating both syntactic and semantic problem-specific constraints into the evolutionary search. The DCTG-GP system improves on other grammar-based GP systems by permitting non--trivial semantic aspects of the language to be defined with the grammar. It also automatically analyses grammar rules in order to determine their minimal depth and termination characteristics, which are required when generating random program trees of varied shapes and sizes. An application using DCTG-GP is described.}, added-at = {2008-06-19T17:35:00.000+0200}, author = {Ross, Brian J.}, biburl = {https://www.bibsonomy.org/bibtex/234acc175f61f701dc43ea2946a354a7a/brazovayeye}, interhash = {44ef77ace8086eb865de59cf90d01290}, intrahash = {34acc175f61f701dc43ea2946a354a7a}, journal = {New Generation Computing}, keywords = {Clause Computation, Definite Evolutionary Grammar, Inference Language Logic Programming, Prolog, Stochastic Translation algorithms, clause definite genetic grammars, programming, translation}, notes = {http://www.ohmsha.co.jp/ngc/}, number = 4, pages = {313--337}, timestamp = {2008-06-19T17:50:40.000+0200}, title = {Logic-based Genetic Programming with Definite Clause Translation Grammars}, url = {http://citeseer.ist.psu.edu/331862.html}, volume = 19, year = 2001 }