Hostname: page-component-cb9f654ff-r5d9c Total loading time: 0 Render date: 2025-08-23T17:08:03.005Z Has data issue: false hasContentIssue false
  • English
  • Français

Properties of Input-Consuming Derivations

Published online by Cambridge University Press:  25 March 2002

ANNALISA BOSSI ,
SABINA ROSSI  and
SANDRO ETALLE
ANNALISA BOSSI
Affiliation:
Dipartimento di Informatica, Università di Venezia, via Torino 155, 30172 Venezia, Italy (e-mail: bossi@dsi.unive.it, srossi@dsi.unive.it)
SABINA ROSSI
Affiliation:
Dipartimento di Informatica, Università di Venezia, via Torino 155, 30172 Venezia, Italy (e-mail: bossi@dsi.unive.it, srossi@dsi.unive.it)
SANDRO ETALLE
Affiliation:
Department of Computer Science, University of Maastricht, P.O. Box 616, 6200 MD Maastricht, The Netherlands (e-mail: etalle@cs.unimaas.nl) CWI – Center for Mathematics and Computer Science, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands
Get access Rights & Permissions [Opens in a new window]

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.

Keywords

dynamic schedulingtermination

Information

Type
Research Article
Information
Theory and Practice of Logic Programming , Volume 2 , Issue 2 , March 2002 , pp. 125 - 154
Copyright
© 2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable