Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes

Authors:
Andreas Hamfelt;Jørgen Fischer Nilsson
Affiliations:
-;-
Venue:
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Year:
1998

Citing 7
Cited 0

Elements of functional programming

Elements of functional programming
Algebra of programming

Algebra of programming
Towards a logic programming methodology based on higher-order predicates

New Generation Computing
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Foundations of Inductive Logic Programming

Foundations of Inductive Logic Programming
Selected Papers from the 6th International Workshop on Inductive Logic Programming

ILP '96 Selected Papers from the 6th International Workshop on Inductive Logic Programming
Inductive Logic Program Synthesis with DIALOGS

ILP '96 Selected Papers from the 6th International Workshop on Inductive Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.