Properties of input-consuming derivations

A Bossi; S Rossi; S Etalle

doi:10.1017/S1471068401001326

Properties of input-consuming derivations

A Bossi^*
, S Rossi
, S Etalle

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

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.

Original language	English
Pages (from-to)	125-154
Number of pages	30
Journal	Theory and Practice of Logic Programming
Volume	2
DOIs	https://doi.org/10.1017/S1471068401001326
Publication status	Published - Mar 2002

Keywords

dynamic scheduling
termination
LOGIC PROGRAMS
DELAY DECLARATIONS
PROLOG PROGRAMS
TERMINATION
SEMANTICS

Access to Document

10.1017/S1471068401001326

Cite this

@article{bdb7f0c9b96740b5980ed12202d3d885,

title = "Properties of input-consuming derivations",

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 scheduling, termination, LOGIC PROGRAMS, DELAY DECLARATIONS, PROLOG PROGRAMS, TERMINATION, SEMANTICS",

author = "A Bossi and S Rossi and S Etalle",

year = "2002",

month = mar,

doi = "10.1017/S1471068401001326",

language = "English",

volume = "2",

pages = "125--154",

journal = "Theory and Practice of Logic Programming",

issn = "1471-0684",

publisher = "Cambridge University Press",

}

TY - JOUR

T1 - Properties of input-consuming derivations

AU - Bossi, A

AU - Rossi, S

AU - Etalle, S

PY - 2002/3

Y1 - 2002/3

N2 - 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.

AB - 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.

KW - dynamic scheduling

KW - termination

KW - LOGIC PROGRAMS

KW - DELAY DECLARATIONS

KW - PROLOG PROGRAMS

KW - TERMINATION

KW - SEMANTICS

U2 - 10.1017/S1471068401001326

DO - 10.1017/S1471068401001326

M3 - Article

SN - 1471-0684

VL - 2

SP - 125

EP - 154

JO - Theory and Practice of Logic Programming

JF - Theory and Practice of Logic Programming

ER -

Properties of input-consuming derivations

Abstract

Keywords

Access to Document

Fingerprint

Cite this