2001/01/23 by Annalisa Bossi, Bossi, Annalisa, Sandro Etalle +6
Computer Science · #Advanced Database Systems and Queries #D.1.3 #D.1.6 #F.3.2 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Programming Languages (cs.PL) #Semantic Web and Ontologies #cs.LO #cs.PL
paper · pdf · doi:10.48550/arxiv.cs/0101022
25 pages, long version of paper with same title at ESOP 2001
arxiv created 2001/01/23 · openalex publication_date 2001/01/23 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed to a fixed selection rule such as the left-to-right one of Prolog. This has applications e.g. in parallel programming. A mechanism to control dynamic scheduling is provided in existing languages in the form of delay declarations. Input-consuming derivations were introduced to describe dynamic scheduling while abstracting from the technical details. In this paper, we first formalise the relationship between delay declarations and input-consuming derivations, showing in many cases a one-to-one correspondence. Then, we define a model-theoretic semantics for input-consuming derivations of simply-moded programs. Finally, for this class of programs, we provide a necessary and sufficient criterion for termination.