Properties of Input-Consuming Derivations

Annalisa Bossi, Sabina Rossi

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

    4 Citations (Scopus)
    77 Downloads (Pure)


    We study the properties of input-consuming derivations of moded logic programs. Input-consuming derivations do not employ a fixed selection rule, and 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 one part of the well-known Switching Lemma holds also for input-consuming derivations. Furthermore, we provide conditions which guarantee that all input-consuming derivations starting in a Nicely-Moded query are finite. The method presented here is easy to apply and generalizes other related works.
    Original languageEnglish
    Title of host publicationICLP'99 International Conference on Logic Programming: Workshop on Verification of Logic Programs
    EditorsSandro Etalle, Jan-Georg Smaus
    Place of PublicationAmsterdam
    Number of pages23
    Publication statusPublished - Dec 1999
    Event16th International Conference on Logic Programming, ICLP 1999 - Las Cruces, United States
    Duration: 29 Nov 19994 Dec 1999
    Conference number: 16

    Publication series

    NameElectronic Notes in Theoretical Computer Science
    ISSN (Print)1571-0661


    Conference16th International Conference on Logic Programming, ICLP 1999
    Abbreviated titleICLP
    Country/TerritoryUnited States
    CityLas Cruces
    Internet address


    • EWI-1022
    • IR-56188


    Dive into the research topics of 'Properties of Input-Consuming Derivations'. Together they form a unique fingerprint.

    Cite this