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

Analysing the implicit complexity of programs

โœ Scribed by J.Y. Marion

Book ID
114273337
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
239 KB
Volume
183
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The complexity of revising logic program
The complexity of revising logic programs
โœ Russell Greiner ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 237 KB

A rule-based program will return a set of answers to each query. An impure program, which includes the Prolog ut ``!'' and ``not@รA'' operators, can return dierent answers if its rules are re-ordered. There are also many reasoning systems that return only the ยฎrst answer found for each query; these

Notes on the complexity of systolic prog
Notes on the complexity of systolic programs
โœ Stephen Taylor; Lisa Hellerstein; Shmuel Safra; Ehud Shapiro ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 894 KB