Semantics of Input-Consuming Logic Programs

J. Lloyd (Editor), Annalisa Bossi, Sandro Etalle, V. Dahl (Editor), U. Furbach (Editor), Sabina Rossi, M. Kerber (Editor), K.K. Lau (Editor), C. Palamidessi (Editor), L. Moniz Pereira (Editor), Y. Sagiv (Editor), P.J. Stuckey (Editor)

    Research output: Contribution to conferencePaperAcademicpeer-review

    3 Citations (Scopus)
    95 Downloads (Pure)


    Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. This class of programs arguably allows to model logic programs employing a dynamic selection rule and constructs such as delay declarations: as shown also in [5], a large number of them are actually input-consuming. In this paper we show that - under some syntactic restrictions - the S-semantics of a program is correct and fully abstract also for input-consuming programs. This allows us to conclude that for a large class of programs employing delay declarations there exists a model-theoretic semantics which is equivalent to the operational one.
    Original languageUndefined
    Number of pages15
    Publication statusPublished - 2000
    EventComputational Logic (CL) - London, UK
    Duration: 1 Jan 20001 Jan 2000


    ConferenceComputational Logic (CL)


    • Semantics
    • Dynamic scheduling
    • Logic Programming
    • EWI-983
    • IR-56162

    Cite this