Schema induction for logic program synthesis

Tinkham, Nancy Lynn

doi:10.1016/s0004-3702(97)00055-6

Cited by 3 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some researchers have recognised that, as far as recursive programs are concerned, the search space could be considerably reduced if programs were constrained to fit certain schemas. The XOANON technique [77] is a variant of MIS that explores a second-order search space (a lattice, actually), ordered by a corresponding extension of θ-subsumption, with second-order expressions (called schemas) at the top, and first-order expressions (i.e., programs) at the bottom. Synthesis starts from a schema believed-to-be-applicable, and the improvement in synthesis time can be exponential when a "good" schema is selected.…”

Section: Example 15mentioning

confidence: 99%

Inductive synthesis of recursive logic programs: achievements and prospects

Flener

Yıilmaz

1999

The Journal of Logic Programming

View full text Add to dashboard Cite

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 of recursive logic programs, but also discussing a few general ILP techniques that can also induce non-recursive hypotheses. Then we analyse the prospects of these techniques in this task, investigating their applicability to software engineering as well as to knowledge acquisition and discovery.

show abstract

Section: Example 15mentioning

confidence: 99%