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

The clean termination of iterative programs

โœ Scribed by Andrzej Blikle

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

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

A note on finite termination of iterativ
A note on finite termination of iterative algorithms in mathematical programming
โœ Jinchuan Zhou; Changyu Wang ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 610 KB

Two well-known results on the unified treatment of finite termination of a class of algorithms for solving convex programming problems and for solving variational inequality problems are reconsidered. In particular, some of the underlying assumptions employed in the existing literature are shown to

A semantic basis for the termination ana
A semantic basis for the termination analysis of logic programs
โœ Michael Codish; Cohavit Taboch ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 287 KB

This paper presents a formal semantic basis for the termination analysis of logic programs. The semantics exhibits the termination properties of a logic program through its binary unfoldings ยฑ a possibly inยฎnite set of binary clauses. Termination of a program P and goal G is determined by the absenc