Inductive synthesis of recursive logic programs: achievements and prospects
✍ Scribed by Pierre Flener; Serap Yıilmaz
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 377 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0743-1066
No coin nor oath required. For personal study only.
✦ Synopsis
The inductive synthesis of recursive logic programs from incomplete information, such as input/output examples, is a challenging sub®eld both of Inductive Logic Programming (ILP) and of the synthesis (in general) of logic programs, from formal speci®cations. We ®rst 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.
📜 SIMILAR VOLUMES
We present a method for proving properties of de®nite logic programs. This method is called unfold/fold proof method because it is based on the unfold/fold transformation rules. Given a program and two goals (that is, conjunctions of atoms) p Y and q Y , where , , and are pairwise disjoint vectors o