Declarative Semantics of Input Consuming Logic Programs

Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi

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

    10 Downloads (Pure)


    Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been introduced to describe dynamic scheduling while abstracting from the technical details. We review and compare the different proposals given in related work for denotational semantics of programs with input consuming derivations. We also show how they can be applied to termination analysis.
    Original languageUndefined
    Title of host publicationProgram Development in Computational Logic
    EditorsMaurice Bruynooghe, Kung-Kia Lau
    Place of PublicationBerlin
    Number of pages25
    ISBN (Print)3-540-22152-2
    Publication statusPublished - Jun 2004

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Verlag


    • EWI-790
    • METIS-220391
    • IR-48686

    Cite this