Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling (2001)
Cached
Download Links
- [www.cs.unimaas.nl]
- [wwwhome.cs.utwente.nl]
- [www.dsi.unive.it]
- DBLP
Other Repositories/Bibliography
| Venue: | Proceedings of the European Symposium on Programming, volume 2028 of Lecture Notes in Computer Science |
| Citations: | 3 - 2 self |
BibTeX
@INPROCEEDINGS{Bossi01semanticsand,
author = {Annalisa Bossi and Sandro Etalle and Sabina Rossi and Jan-georg Smaus},
title = {Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling},
booktitle = {Proceedings of the European Symposium on Programming, volume 2028 of Lecture Notes in Computer Science},
year = {2001},
pages = {402--416},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. In this paper, we first formalize the relationship between delay declarations and inputconsuming 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 sucient criterion for termination.
