Sensitive ants are sensible ants

This paper introduces an approach to evolving computer programs using an Attribute Grammar (AG) extension of Grammatical Evolution (GE) to eliminate ineffective pieces of code with the help of context-sensitive information. The standard Context-Free Grammars (CFGs) used in GE, Genetic Programming (GP) (which uses a special type of CFG with just a single non-terminal) and most other grammar-based system are not well-suited for codifying information about context. AGs, on the other hand, are grammars that contain functional units that can help determine context which, as this paper demonstrates, is key to removing ineffective code. The results presented in this paper indicate that, on a selection of grammars, the prevention of the appearance of ineffective code through the use of context analysis significantly improves the performance of and resistance to code bloat over both standard GE and GP for both Santa Fe Trail (SFT) and Los Altos Hills (LAH) trail version of the ant problem with same amount of energy used.

[1]  Conor Ryan,et al.  Adaptive logic programming , 2001 .

[2]  Norman R. Paterson,et al.  Genetic programming with context-sensitive grammars , 2003 .

[3]  Sean Luke,et al.  A Comparison of Bloat Control Methods for Genetic Programming , 2006, Evolutionary Computation.

[4]  Maarten Keijzer,et al.  Scientific discovery using genetic programming , 2001 .

[5]  Hussein A. Abbass,et al.  Tree Adjoining Grammars, Language Bias, and Genetic Programming , 2003, EuroGP.

[6]  Peter A. Whigham,et al.  Grammar-based Genetic Programming: a survey , 2010, Genetic Programming and Evolvable Machines.

[7]  Alfonso Ortega,et al.  Attribute Grammar Evolution , 2005, IWINAC.

[8]  Nguyen Xuan Hoai,et al.  Some Experimental Results with Tree Adjunct Grammar Guided Genetic Programming , 2002, EuroGP.

[9]  Michael O'Neill,et al.  Grammatical Evolution: Evolving Programs for an Arbitrary Language , 1998, EuroGP.

[10]  Alfonso Ortega,et al.  Christiansen Grammar Evolution: Grammatical Evolution With Semantics , 2007, IEEE Transactions on Evolutionary Computation.

[11]  Terence Soule,et al.  Code growth in genetic programming , 1996 .

[12]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[13]  Conor Ryan,et al.  A New Approach to Solving 0-1 Multiconstraint Knapsack Problems Using Attribute Grammar with Lookahead , 2011, EuroGP.

[14]  Tobias Blickle,et al.  Theory of evolutionary algorithms and application to system synthesis , 1997 .

[15]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[16]  Conor Ryan,et al.  Degeneracy Reduction or Duplicate Elimination? An Analysis on the Performance of Attributed Grammatical Evolution with Lookahead to Solve the Multiple Knapsack Problem , 2011, NICSO.

[17]  Michael O'Neill,et al.  Grammatical evolution - evolutionary automatic programming in an arbitrary language , 2003, Genetic programming.