Abstract
We discuss issues of control for constraint logic programs. The problem we try to solve is to find, from the text of a program, a computation rule which ensures finiteness of the computation tree. In a single framework, we address two related areas, namely the generation of control annotations and the local level of control for partial deduction.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Bruynooghe, D. De Schreye, and B. Martens. A general criterion for avoiding infinite unfolding during partial deduction. New Generation Computing, 11(1):47–79, 1992.
P. Codognet and G. Filé. Computations, abstractions and contraints in logic programming. Proc. of ICCL'92, 1992.
A. Colmerauer. An introduction to Prolog III. CACM, 33 (7):70–90, July 1990.
S. Decorte, F. Stefaan, and D. De Schreye. Automatic inference of norms: a missing link in automation termination analysis. In Logic Programming — Proceedings of 1993 International Symposium, pages 420–436, 1993.
D. De Schreye and S. Decorte. Termination of logic programs: the never-ending story. Journal of Logic Programming, pages 1–199, 1993.
L. Fribourg and M. Veloso Peixoto. Bottom-up evaluation of datalog programs with arithmetic constraints: The case of 3 recursive rules. Technical report, L.I.E.N.S, France, 1994.
R. Giacobazzi and L. Ricci. Detecting determinate computations by bottom-up abstract interpretation. Technical report, Università di Pisa, 1992.
P. Hill and J. Lloyd. The Gödel Programming Language. MIT Press, 1994.
J. Jaffar and J.L. Lassez. Constraint logic programming. Technical Report 74, Monach University, Australia, 1986.
J. Jaffar and M.J. Maher. Constraint logic programming: a survey. J. Logic Programming, pages 503–581, 1994.
S. Lüettringhaus-Kappel. Control generation for logic programs. Proc. of 10th ICLP, pages 478–495, 1993.
B. Martens and D. De Schreye. Automatic finite unfolding using well-founded measures. Journal of Logic programming, To appear.
B. Martens and J. Gallagher. Ensuring global termination of partial deduction while allowing flexible polyvariance. Proc. of ICLP'95, 1995.
F. Mesnard. Etude de la terminaison des programmes logiques avec contraintes, au moyen d'approximations. PhD thesis, Université Paris VI, 1993.
L. Naish. Negation and control in prolog. In LNCS 238. Springer-Verlag, 1985.
L. Plümer. Termination proofs fo logic programs. Springer-Verlag, 1989.
B. Saglam and J.P. Gallagher. Approximating constraint logic programs using polymorphic types and regular descriptions. Technical report, University of Bristol, Dpt of Computer Science, 1995.
K. Sohn. Constraints among argument sizes in logic programs. Proc. of PODS'94, pages 68–74, 1994.
K. Sohn and A. Van Gelder. Termination detection in logic programs using argument sizes. Proc. of PODS'91, pages 216–226, 1991.
J.D. Ullman and A. Van Gelder. Efficient tests for top-down termination of logical rules. Journal of the ACM, 35(2):345–373, 1988.
K. Verschaetse and D. De Schreye. Deriving termination proofs for logic programs, using abstract procedures. Proc. of the 8th ICLP, pages 301–315, 1991.
K. Verschaetse and D. De Schreye. Derivation of linear size relations by abstract interpretation. In LNCS 631, pages 296–310. Springer Verlag, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mesnard, F. (1996). Towards automatic control for CLP(χ) programs. In: Proietti, M. (eds) Logic Program Synthesis and Transformation. LOPSTR 1995. Lecture Notes in Computer Science, vol 1048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60939-3_8
Download citation
DOI: https://doi.org/10.1007/3-540-60939-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60939-1
Online ISBN: 978-3-540-49745-5
eBook Packages: Springer Book Archive