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

Recursive assertions and parallel programs

โœ Scribed by Krzysztof R. Apt

Publisher
Springer-Verlag
Year
1981
Tongue
English
Weight
690 KB
Volume
15
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A model for recursive-parallel programs
A model for recursive-parallel programs
โœ Olga Kouchnarenko; Ph. Schnoebelen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 31 KB
On the Equivalence of Recursive and Nonr
On the Equivalence of Recursive and Nonrecursive Datalog Programs
โœ Surajit Chaudhuri; Moshe Y Vardi ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 591 KB

We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. Since nonrecursive Datalog programs are equivalent to unions of conjunctive queries, we study also the problem of determining whether a given recursive Datalog program

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