Independence in dynamically scheduled logic languages

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

    1 Citation (Scopus)


    The notion of independence has been used in conventional logic programming as the basis for several optimizations, including program parallelization, intelligent backtracking, and goal reordering. In this paper we extend this notion to logic programming languages with dynamic scheduling. This type of scheduling, in which some calls are dynamically “delayed” until their arguments are sufficiently instantiated, is provided in most practical implementations because it offers advantages for both programming power and declarativeness. We focus on the notion of independence required for ensuring correctness and efficiency of parallelization within the independent and-parallel model. We also provide sufficient conditions for independence which can be evaluated “a-priori” (i.e., at run-time), as is needed in many practical applications.
    Original languageEnglish
    Title of host publicationAlgebraic and Logic Programming
    Subtitle of host publication5th International Conference, ALP'96 Aachen, Germany, September 25-27, 1996 Proceedings
    EditorsMichael Hanus, Mario Rodrfguez-Artalejo
    Place of PublicationBerlin Germany
    Number of pages15
    ISBN (Print)3540617353
    Publication statusPublished - 1996
    EventInternational Conference on Algebraic and Logic Programming 1996 - Aachen, Germany
    Duration: 25 Sep 199627 Sep 1996
    Conference number: 5th (Proceedings)

    Publication series

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


    ConferenceInternational Conference on Algebraic and Logic Programming 1996
    Abbreviated titleALP 1996
    Internet address

    Cite this