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

Semantics of well-moded input-consuming logic programs

โœ Scribed by Annalisa Bossi; Sandro Etalle; Sabina Rossi

Book ID
114107541
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
183 KB
Volume
26
Category
Article
ISSN
0096-0551

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Termination of well-moded programs
Termination of well-moded programs
โœ S. Etalle; A. Bossi; N. Cocco ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1001 KB

We study the termination properties of well-moded programs, and we show thz, t. under suitable conditions, for these programs there exists an algebraic characteriza zion -in the style of Apt and Pedreschi, Studies in pure prolog: termination, in: J.W. Lloyd ted.), Proceedings of the Simposium in Com

Semantics of structured normal logic pro
Semantics of structured normal logic programs
โœ Edelmira Pasarella; Fernando Orejas; Elvira Pino; Marisa Navarro ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 606 KB
The semantics of constraint logic progra
The semantics of constraint logic programs
โœ Joxan Jaffar; Michael Maher; Kim Marriott; Peter Stuckey ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 350 KB

The Constraint Logic Programming (CLP) Scheme was introduced by Jaar and Lassez. The scheme gave a formal framework, based on constraints, for the basic operational, logical and algebraic semantics of an extended class of logic programs. This paper presents for the ยฎrst time the semantic foundations