Sciweavers

53 search results - page 3 / 11
» The Induction of Finite Transducers Using Genetic Programmin...
Sort
View
PRICAI
2004
Springer
14 years 21 days ago
Power of Brute-Force Search in Strongly-Typed Inductive Functional Programming Automation
Abstract. A successful case of applying brute-force search to functional programming automation is presented and compared with a conventional genetic programming method. From the i...
Susumu Katayama
JLP
2007
114views more  JLP 2007»
13 years 7 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
14 years 1 months ago
Why evolution is not a good paradigm for program induction: a critique of genetic programming
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
John R. Woodward, Ruibin Bai
EMO
2006
Springer
120views Optimization» more  EMO 2006»
13 years 9 months ago
Rule Induction for Classification Using Multi-objective Genetic Programming
Multi-objective metaheuristics have previously been applied to partial classification, where the objective is to produce simple, easy to understand rules that describe subsets of a...
Alan P. Reynolds, Beatriz de la Iglesia
POPL
2010
ACM
14 years 4 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno