Efficient Exhaustive Generation of Functional Programs Using Monte-Carlo Search with Iterative Deepening

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

@InProceedings{Katayama:2008:PRICAI,

• author = "Susumu Katayama",
• title = "Efficient Exhaustive Generation of Functional Programs Using Monte-Carlo Search with Iterative Deepening",
• booktitle = "10th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2008)",
• year = "2008",
• editor = "Tu-Bao Ho and Zhi-Hua Zhou",
• series = "LNCS",
• pages = "199--210",
• address = "Hanoi, Vietnam",
• month = dec # " 15-19",
• publisher = "Springer",
• keywords = "genetic algorithms, genetic programming",
• isbn13 = "978-3-540-89197-0",
• language = "en",
• oai = "oai:CiteSeerX.psu:10.1.1.606.1447",
• URL = "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.606.1447",
• URL = "http://nautilus.cs.miyazaki-u.ac.jp/~skata/skatayama_pricai2008.pdf",
• URL = "https://doi.org/10.1007/978-3-540-89197-0_21",
• DOI = "doi:10.1007/978-3-540-89197-0_21",
• size = "11 pages",
• abstract = "Genetic programming and inductive synthesis of functional programs are two major approaches to inductive functional programming. Recently, in addition to them, some researchers pursue efficient exhaustive program generation algorithms, partly for the purpose of providing a comparator and knowing how essential the ideas such as heuristics adopted by those major approaches are, partly expecting that approaches that exhaustively generate programs with the given type and pick up those which satisfy the given specification may do the task well. In exhaustive program generation, since the number of programs exponentially increases as the program size increases, the key to success is how to restrain the exponential bloat by suppressing semantically equivalent but syntactically different programs. In this paper we propose an algorithm applying random testing of program equivalences (or Monte-Carlo search for functional differences) to the search results of iterative deepening, by which we can totally remove redundancies caused by semantically equivalent programs. Our experimental results show that applying our algorithm to subexpressions during program generation remarkably reduces the computational costs when applied to rich primitive sets.",
• notes = "Trends in Artificial Intelligence",

}

Genetic Programming entries for Susumu Katayama

Citations