Sciweavers

Share
LOPSTR
1998
Springer

Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes

8 years 10 months ago
Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic programs from examples. The combinators comprise fold combinators for recursion on lists. The combinator form is distinguished by enabling piecewise composition of semantically meaningful program elements according to the compositional semantics principle. The principle of combining programs from combinators admits induction of programs without appealing to most-specific-generalization and predicate invention in contrast to prevailing ILP approaches. Moreover, the combinator form avoids confusing object and metavariables in the applied metalogic program environment. In addition useful algebraic rewriting rules can be formulated conveniently with the combinators.
Andreas Hamfelt, Jørgen Fischer Nilsson
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1998
Where LOPSTR
Authors Andreas Hamfelt, Jørgen Fischer Nilsson
Comments (0)
books