Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling


Share/Save/Bookmark

Etalle, Sandro and Bossi, Annalisa and Rossi, Sabina and Smaus, Jan-Georg (2001) Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling. In: 10th European Symposium on Programming, ESOP 2001, April 2-6, 2001, Genova, Italy (pp. pp. 402-416).

open access
[img]
Preview
PDF
300kB
Abstract: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. 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.
Item Type:Conference or Workshop Item
Copyright:© 2001 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/36869
Official URL:http://dx.doi.org/10.1007/3-540-45309-1_27
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 203294