Abstract
In this paper, we introduce a method for proving universal termination of constraint logic programs by strictly extending the approach of Apt and Pedreschi [1]. Taking into account a generic constraint domain instead of the standard Herbrand univers, acceptable (CLP) programs are defined. We prove correctness and completeness of the method w.r.t. the leftmost selection rule for the class of ideal constraint systems, including CLP(R lin ), CLP(RT), and CLP(FT) among the others. Moreover, we investigate the problems arising in extending those results to non-ideal constraint system, by specifically designing sufficient conditions for termination of CLP(R) programs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt and D. Pedreschi. Studies in Pure Prolog: Termination. In J. W. Lloyd, editor, Symposium on Computational Logic, pages 150–176. Springer-Verlag, Berlin, 1990.
M. Bezem. Characterizing termination of logic programs with level mappings. In E. L. Lusk and R. A. Overbeek, editors, Proceedings of the North American Conference on Logic Programming, pages 69–80. The MIT Press, 1989.
L. Colussi, E. Marchiori, and M. Marchiori. On Termination of Constraint Logic Programs. In M. Bruynooghe and J. Penjam, editors, Proc. of PPCP'95, number 976 in Lectures Notes in Computer Science, 1995.
M. Hanus. Analysis of nonlinear constraints in CLP(R). In D. S. Warren, editor, Proceedings of the 1993 International Conference on Logic Programming, pages 83–99. MIT Press, 1993.
P. Stuckey, J. Jaffar, S. Michaylov and R. Yap. The CLP(R) Language and System. ACM Toplas, 14(3):339–395, 1992.
J. Jaffar and M.J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19,20:503–581, 1994.
M.J. Maher. A Logic Programming View of CLP. In D. S. Warren, editor, Proceedings of the 1993 International Conference on Logic Programming. The MIT Press, 1993.
F. Mesnard. Inferring Left-terminating Classes of Queries for Constraint Logic Programs. In M. Maher, editor, Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, pages 7–21. The MIT Press, 1996.
D. De Schreye and S. Decorte. Termination of logic programs: the never-ending story. Journal of Logic Programming, 19–20:199–260, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ruggieri, S. (1997). Termination of constraint logic programs. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_236
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_236
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive