Termination of Simply Moded Logic Programs with Dynamic Scheduling

Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus

    Research output: Contribution to journalArticleAcademicpeer-review

    8 Citations (Scopus)
    20 Downloads (Pure)


    In logic programming, dynamic scheduling indicates the feature by means of which the choice of the atom to be selected at each resolution step is done at runtime and does not follow a fixed selection rule such as the left-to-right one of Prolog. Input consuming derivations were introduced to model dynamic scheduling while abstracting from the technical details. In this article, we provide a sufficient and necessary criterion for termination of input consuming derivations of simply moded logic programs. The termination criterion we propose is based on a denotational semantics for partial derivations which is defined in the spirit of model-theoretic semantics previously proposed for left-to-right derivations.
    Original languageUndefined
    Pages (from-to)470-507
    Number of pages38
    JournalACM transactions on computational logic
    Issue number3
    Publication statusPublished - Jul 2004


    • METIS-220237
    • IR-48621
    • EWI-741

    Cite this