๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Recursive Program Optimization through Inductive Synthesis Proof Transformation

โœ Scribed by Peter Madden; Alan Bundy; Alan Smaill

Book ID
110230900
Publisher
Springer Netherlands
Year
1999
Tongue
English
Weight
362 KB
Volume
22
Category
Article
ISSN
0168-7433

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Inductive synthesis of recursive logic p
Inductive synthesis of recursive logic programs: achievements and prospects
โœ Pierre Flener; Serap Yฤฑilmaz ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 377 KB

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 achieve

Synthesis and transformation of logic pr
Synthesis and transformation of logic programs using unfold/fold proofs
โœ Alberto Pettorossi; Maurizio Proietti ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 408 KB

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