Properties of Input-Consuming Derivations

Authors:
Annalisa Bossi;Sabina Rossi;Sandro Etalle
Affiliations:
Dipartimento di Informatica, Università di Venezia, via Torino 155, 30172 Venezia, Italy (e-mail: bossi@dsi.unive.it, srossi@dsi.unive.it);Dipartimento di Informatica, Università di Venezia, via Torino 155, 30172 Venezia, Italy (e-mail: bossi@dsi.unive.it, srossi@dsi.unive.it);Department of Computer Science, University of Maastricht, P.O. Box 616, 6200 MD Maastricht, The Netherlands (e-mail: etalle@cs.unimaas.nl) and (a3) CWI -- Center for Mathematics and Computer Scien ...
Venue:
Theory and Practice of Logic Programming
Year:
2002

Citing 15
Cited 5

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Logic programming

Handbook of theoretical computer science (vol. B)
Acyclic logic programs and the completeness of SLDNF-resolution

Theoretical Computer Science
Strong termination of logic programs

Journal of Logic Programming
Reasoning about termination of pure Prolog programs

Information and Computation
On the occur-check-free PROLOG programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Go¨del programming language

The Go¨del programming language
Moded flat GHC and its message-oriented implementation technique

New Generation Computing
Modular termination proofs for logic and pure PROLOG programs

Advances in logic programming theory
From logic programming to Prolog

From logic programming to Prolog
Constraint logic programming with dynamic scheduling: a semantics based on closure operators

Information and Computation
Proving termination of input-consuming logic programs

Proceedings of the 1999 international conference on Logic programming
Verification of Logic Programs with Delay Declarations

AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Termination of Logic Programs with block Declarations Running in Several Modes

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
GHC - A Language for a New Age of Parallel Programming

Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science

Termination of well-typed logic programs

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
On logic programs that always succeed

Science of Computer Programming
Termination of simply moded logic programs with dynamic scheduling

ACM Transactions on Computational Logic (TOCL)
Input-termination of logic programs

LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Fast and accurate strong termination analysis with an application to partial evaluation

WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the properties of input-consuming derivations of moded logic programs. Input-consuming derivations can be used to model the behavior of logic programs using dynamic scheduling and employing constructs such as delay declarations. We consider the class of nicely-moded programs and queries. We show that for these programs a weak version of the well-known switching lemma holds also for input-consuming derivations. Furthermore, we show that, under suitable conditions, there exists an algebraic characterization of termination of input-consuming derivations.