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 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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495–574. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.
K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.
K. R. Apt and S. Etalle. On the unification free Prolog programs. In A. Borzyszkowski and S. Sokolowski, editors, Proceedings of MFCS’ 93, LNCS, pages 1–19. Springer-Verlag, 1993.
K. R. Apt and I. Luitjes. Verification of logic programs with delay declarations. In V. S. Alagar and M. Nivat, editors, Proceedings of AMAST’95, LNCS, pages 66–90. Springer-Verlag, 1995. Invited Lecture.
K. R. Apt and D. Pedreschi. Modular termination proofs for logic and pure Prolog programs. In G. Levi, editor, Advances in Logic Programming Theory, pages 183–229. Oxford University Press, 1994.
A. Bossi, S. Etalle, and S. Rossi. Properties of input-consuming derivations. ENTCS, 30(1), 1999. http://www.elsevier.nl/locate/entcs.
A. Bossi, S. Etalle, and S. Rossi. Semantics of input-consuming programs. In J. Lloyd, editor, CL 2000. Springer-Verlag, 2000.
A. Bossi, S. Etalle, S. Rossi, and J.-G. Smaus. Semantics and termination of simply-moded logic programs with dynamic scheduling. Available via CoRR: http://arXiv.org/archive/cs/intro.html, 2001.
A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: theory and applications. Journal of Logic Programming, 19/20:149–197, 1994.
S. Etalle, A. Bossi, and N. Cocco. Termination of well-moded programs. Journal of Logic Programming, 38(2):243–257, 1999.
M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Constraint logic programming with dynamic scheduling: A semantics based on closure operators. Information and Computation, 137:41–67, 1997.
P. M. Hill and J. W. Lloyd. The Gödel Programming Language. The MIT Press, 1994.
Intelligent Systems Laboratory, Swedish Institute of Computer Science, PO Box 1263, S-164 29 Kista, Sweden. SICStus Prolog User’s Manual, 1998. http://www.sics.se/sicstus/docs/3.7.1/html/sicstus toc.html.
R. A. Kowalski. Algorithm = Logic + Control. Communications of the ACM, 22(7):424–436, 1979.
J. W. Lloyd. Foundations of Logic Programming. Symbolic Computation-Artificial Intelligence. Springer-Verlag, 1987.
L. Naish. Negation and Control in Prolog, volume 238 of LNCS. Springer-Verlag, 1986.
L. Naish. Parallelizing NU-Prolog. In R. A. Kowalski and K. A. Bowen, editors, Proceedings of ICLP/SLP’ 88, pages 1546–1564. MIT Press, 1988.
J.-G. Smaus. Proving termination of input-consuming logic programs. In D. De Schreye, editor, Proceedings of ICLP’99, pages 335–349. MIT Press, 1999.
L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986.
K. Ueda and M. Morita. Moded Flat GHC and its message-oriented implementation technique. New Generation Computing, 13(1):3–43, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bossi, A., Etalle, S., Rossi, S., Smaus, JG. (2001). Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling. In: Sands, D. (eds) Programming Languages and Systems. ESOP 2001. Lecture Notes in Computer Science, vol 2028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45309-1_27
Download citation
DOI: https://doi.org/10.1007/3-540-45309-1_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41862-7
Online ISBN: 978-3-540-45309-3
eBook Packages: Springer Book Archive