Properties of input-consuming derivations

A Bossi*, S Rossi, S Etalle

*Corresponding author for this work

    Research output: Contribution to journalArticleAcademicpeer-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 languageEnglish
    Pages (from-to)125-154
    Number of pages30
    JournalTheory and Practice of Logic Programming
    Volume2
    DOIs
    Publication statusPublished - Mar 2002

    Keywords

    • dynamic scheduling
    • termination
    • LOGIC PROGRAMS
    • DELAY DECLARATIONS
    • PROLOG PROGRAMS
    • TERMINATION
    • SEMANTICS

    Fingerprint

    Dive into the research topics of 'Properties of input-consuming derivations'. Together they form a unique fingerprint.

    Cite this