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.
منابع مشابه
Towards Combinatory Logic Synthesis
A theory of composition synthesis based on inhabitation in combinatory logic is described and illustrated with examples. Composition synthesis automatically generates applicative combinations of typed combinators inhabiting a goal type. In the intended applications, combinatory type environments model repositories of components, and types are used to specify their interfaces enriched with seman...
متن کاملInductive Program Synthesis as Induction of Context - Free Tree Grammars
We present an application of grammar induction in the domain of inductive program synthesis. Synthesis of recursive programs from input/output examples involves the solution of two subproblems: transforming examples into straightforward programs and folding straightforward programs into (a set of) recursive equations. In this paper we focus on the second part of the synthesis problem, which cor...
متن کاملA Theory of Staged Composition Synthesis ( Extended Version )
Composition synthesis is based on the idea of using inhabitation in combinatory logic with intersection types as a foundation for computing compositions from component repositories. Components implemented in a language L1 are exposed to composition synthesis in the form of typed combinator symbols. In practice, it is useful to augment the collection of components in the implementation language ...
متن کاملInductive Synthesis of Recursive Logic Programs: Achievements and Prospects
The inductive synthesis of recursive logic programs from incomplete information, such as input/output examples, is a challenging subfield both of ILP (Inductive Logic Programming) and of the synthesis (in general) of logic programs from formal specifications. We first overview past and present achievements, focusing on the techniques that were designed specifically for the inductive synthesis o...
متن کاملBounded Combinatory Logic
In combinatory logic one usually assumes a fixed set of basic combinators (axiom schemes), usually K and S. In this setting the set of provable formulas (inhabited types) is Pspacecomplete in simple types and undecidable in intersection types. When arbitrary sets of axiom schemes are considered, the inhabitation problem is undecidable even in simple types (this is known as Linial-Post theorem)....
متن کامل