z-logo
open-access-imgOpen Access
Logic-based genetic programming with definite clause translation grammars
Author(s) -
Brian J. Ross
Publication year - 2001
Publication title -
new generation computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.277
H-Index - 27
eISSN - 1882-7055
pISSN - 0288-3635
DOI - 10.1007/bf03037572
Subject(s) - computer science , definite clause grammar , tree adjoining grammar , programming language , natural language processing , context free grammar , genetic programming , artificial intelligence , context sensitive grammar , rule based machine translation , attribute grammar , grammar , affix grammar , synchronous context free grammar , l attributed grammar , generative grammar , linguistics , example based machine translation , philosophy
DCTG-GP is a genetic programming,system that uses def- inite clause translation grammars. A DCTG is a logical version of an attribute grammar that supports the denition,of context{free languages, and it allows semantic information associated with a language to be eas- ily accomodated by the grammar. This is useful in genetic programming for dening the interpreter of a target language, or incorporating both syntactic and semantic problem{specic,contraints 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 dened,with the grammar. It also automatically analyzes grammar rules in order to determine their minimal depth and termination characteris- tics, which are required when generating random program trees of varied shapes and sizes. An application using DCTG-GP is described. , Keywords Genetic Programming, Evolutionary Computation, De-

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom