Declarative semantics of input consuming logic programs

A. Bossi, N. Cocco, S. Etalle, S. Rossi

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

    1 Citation (Scopus)


    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. In this paper we review and compare the different proposals given in [9], [10] and [12] for denotational semantics of programs with input consuming derivations. We also show how they can be applied to termination analysis.
    Original languageEnglish
    Title of host publicationProgram Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development
    EditorsM. Bruynooghe, K.K. Lau
    ISBN (Print)3-540-22152-2
    Publication statusPublished - 2004

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743


    Dive into the research topics of 'Declarative semantics of input consuming logic programs'. Together they form a unique fingerprint.

    Cite this