Utilization of reductions and abstraction elimination in typed genetic programming

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{Kren:2014:GECCO,

• author = "Tomas Kren and Roman Neruda",
• title = "Utilization of reductions and abstraction elimination in typed genetic programming",
• booktitle = "GECCO '14: Proceedings of the 2014 conference on Genetic and evolutionary computation",
• year = "2014",
• editor = "Christian Igel and Dirk V. Arnold and Christian Gagne and Elena Popovici and Anne Auger and Jaume Bacardit and Dimo Brockhoff and Stefano Cagnoni and Kalyanmoy Deb and Benjamin Doerr and James Foster and Tobias Glasmachers and Emma Hart and Malcolm I. Heywood and Hitoshi Iba and Christian Jacob and Thomas Jansen and Yaochu Jin and Marouane Kessentini and Joshua D. Knowles and William B. Langdon and Pedro Larranaga and Sean Luke and Gabriel Luque and John A. W. McCall and Marco A. {Montes de Oca} and Alison Motsinger-Reif and Yew Soon Ong and Michael Palmer and Konstantinos E. Parsopoulos and Guenther Raidl and Sebastian Risi and Guenther Ruhe and Tom Schaul and Thomas Schmickl and Bernhard Sendhoff and Kenneth O. Stanley and Thomas Stuetzle and Dirk Thierens and Julian Togelius and Carsten Witt and Christine Zarges",
• isbn13 = "978-1-4503-2662-9",
• pages = "943--950",
• keywords = "genetic algorithms, genetic programming",
• month = "12-16 " # jul,
• organisation = "SIGEVO",
• address = "Vancouver, BC, Canada",
• URL = "http://doi.acm.org/10.1145/2576768.2598361",
• DOI = "doi:10.1145/2576768.2598361",
• publisher = "ACM",
• publisher_address = "New York, NY, USA",
• abstract = "Lambda calculus representation of programs offers a more expressive alternative to traditional S-expressions. In this paper we discuss advantages of this representation coming from the use of reductions (beta and eta) and a way to overcome disadvantages caused by variables occurring in the programs by use of the abstraction elimination algorithm. We discuss the role of those reductions in the process of generating initial population and propose two novel crossover operations based on abstraction elimination capable of handling general form of typed lambda term while being a straight generalization of the standard crossover operation. We compare their performances using the even parity benchmark problem.",
• notes = "Also known as \cite{2598361} GECCO-2014 A joint meeting of the twenty third international conference on genetic algorithms (ICGA-2014) and the nineteenth annual genetic programming conference (GP-2014)",

}

Genetic Programming entries for Tomas Kren Roman Neruda

Citations