Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities

Authors:
Emanuel Kitzelmann;Ute Schmid
Affiliations:
Department of Information Systems and Applied Computer Science, University of Bamberg, 96045 Bamberg, Germany;Department of Information Systems and Applied Computer Science, University of Bamberg, 96045 Bamberg, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 7
Cited 0

BMWk revisited: generalization and formalization of an algorithm for detecting recursive relations in term sequences

ECML-94 Proceedings of the European conference on machine learning on Machine Learning
Inductive functional programming using incremental program transformation

Artificial Intelligence
A Methodology for LISP Program Construction from Examples

Journal of the ACM (JACM)
Machine Learning

Machine Learning
Automatic Program Construction Techniques

Automatic Program Construction Techniques
Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach

The Journal of Machine Learning Research
The maude 2.0 system

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a technique for inducing functional programs from few, well chosen input/output-examples (I/O-examples). Potential applications for automatic program or algorithm induction are to enable end users to create their own simple programs, to assist professional programmers, or to automatically invent completely new and efficient algorithms. In our approach, functional programs are represented as constructor term rewriting systems (CSs) containing recursive rules. I/O-examples for a target function to be implemented are a set of pairs of terms (F(i"i),o"i) meaning that F(i"i)-denoting application of function F to input i"i-is rewritten to o"i by a CS implementing the function F. Induction is based on detecting syntactic regularities between example terms. In this paper we present theoretical results and describe an algorithm for inducing CSs over arbitrary signatures/data types which consist of one function defined by an arbitrary number of rules with an arbitrary number of non-nested recursive calls in each rule. Moreover, we present empirical results based on a prototypical implementation.