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

Termination of well-moded programs

โœ Scribed by S. Etalle; A. Bossi; N. Cocco

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
1001 KB
Volume
38
Category
Article
ISSN
0743-1066

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 Computational Logic, Springer. Berlin. 1990. pp. 150-176 of the property of being terminating. This characterization enjoys the prorberties of being compositional and. to some extent, of being easy to check.

๐Ÿ“œ SIMILAR VOLUMES

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