Files in this item
Genetic programming with context-sensitive grammars
Item metadata
dc.contributor.advisor | Livesey, Mike | |
dc.contributor.author | Paterson, Norman R. | |
dc.coverage.spatial | 241 p. | en_US |
dc.date.accessioned | 2018-07-05T12:01:14Z | |
dc.date.available | 2018-07-05T12:01:14Z | |
dc.date.issued | 2003 | |
dc.identifier.uri | https://hdl.handle.net/10023/14984 | |
dc.description.abstract | This thesis presents Genetic Algorithm for Deriving Software (Gads), a new technique for genetic programming. Gads combines a conventional genetic algorithm with a context-sensitive grammar. The key to Gads is the onto genic mapping, which converts a genome from an array of integers to a correctly typed program in the phenotype language defined by the grammar. A new type of grammar, the reflective attribute grammar (rag), is introduced. The rag is an extension of the conventional attribute grammar, which is designed to produce valid sentences, not to recognize or parse them. Together, Gads and rags provide a scalable solution for evolving type-correct software in independently-chosen context-sensitive languages. The statistics of performance comparison is investigated. A method for representing a set of genetic programming systems or problems on a cladogram is presented. A method for comparing genetic programming systems or problems on a single rational scale is proposed. | en_US |
dc.language.iso | en | en_US |
dc.publisher | University of St Andrews | |
dc.subject.lcc | QA76.623P2 | |
dc.subject.lcsh | Genetic programming (Computer science) | en |
dc.title | Genetic programming with context-sensitive grammars | en_US |
dc.type | Thesis | en_US |
dc.type.qualificationlevel | Doctoral | en_US |
dc.type.qualificationname | PhD Doctor of Philosophy | en_US |
dc.publisher.institution | The University of St Andrews | en_US |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.