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

Proof of termination within a weak logic of programs

โœ Scribed by David C. Luckham; Norihisa Suzuki

Publisher
Springer-Verlag
Year
1977
Tongue
English
Weight
679 KB
Volume
8
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ 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

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

Synthesis and transformation of logic pr
Synthesis and transformation of logic programs using unfold/fold proofs
โœ Alberto Pettorossi; Maurizio Proietti ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 408 KB

We present a method for proving properties of deยฎnite logic programs. This method is called unfold/fold proof method because it is based on the unfold/fold transformation rules. Given a program and two goals (that is, conjunctions of atoms) p Y and q Y , where , , and are pairwise disjoint vectors o