Abstract
We study ”à la Tamaki-Sato” transformations of constraint logic programs. We give an operational and fixpoint semantics of our constraint logic programs, show that the operational semantics is sound and complete with respect to the fixpoint semantics; we then extend the Tamaki-Sato transformation system into a fold-unfold transformation system which can take care of constraints and we give a direct proof of its correctness which is simpler than the Tamaki-Sato proof.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Bossi; N. Cocco; S. Dulli. A method for specializing logic programs. ACM Trans on programming langages and systems, Vol. 12, 2, April 1990, 253–302.
R.M. Burstall; J. Darlington. A transformation system for deriving recursive programs, JACM, Vol. 24, 1, 1977.
F. Denis, J.P. Delahaye. Unfolding, procedural and fixpoint semantics of logic programs Proc. STACS'1991, LNCS 480, 1991, 511–522.
M. Falaschi; G. Levi; M. Martelli; C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages, Theoretical Computer Science 69, 1989, 289–318.
M Gabbrielli; G. Levi. Modeling answer constraints in Constraint Logic Programs. Proc. eight int. conf. on Logic Programming, eds. Koichi & Furukawa, 1991, 238–252.
J. Jaffar; J.L. Lassez. Constraint logic programming, Proc. fourteenth ACM symp. on principles of programming languages, 1987, 111–119.
J. Jaffar; J.L. Lassez. Constraint logic programming, Tech. report, Department of Computer Science, Monash university, June 1986.
P. Kanellakis; G. Kuper; P. Revesz. Constraint Query Languages, Tech. report, Department of Computer Science, Brown university, November 1990.
G. Levi. Models, unfolding rules and fixpoint semantics, Proc.of the fifth international conf. on Logic programming, 1988, 1649–1665.
J.W. Lloyd. Foundations of logic programming, Springer-Verlag, Berlin, 1987.
M.J. Maher. Equivalences of logic programs, Fondations of Deductive Databases and Logic Programming, J. Minker Ed., Morgan-Kaufmann, Los Altos, 1988, 627–658.
M.J.Maher. Correctness of a logic program transformation system, IBM Research Report RC 13496, T.J. Watson Research center, 1987.
M.J. Maher, A transformation system for deductive database modules with perfect model semantics. Theoretical Computer Science 110, 1993, 377–403.
A. Parrain; P. Devienne; P. Lebegue. Techniques de transformations de programmes généraux et validation de meta-interpréteurs, BIGRE 1991.
M. Proietti, A. Pettorossi. An abstract strategy for transforming logic programs, Fundamenta Informaticae, Vol. 18, 1993, 267–286.
M. Proietti, A. Pettorossi. Semantics preserving transformation rules for Prolog, Proc. PEPM'91, ACM-SIGPLAN 9, 1991, 274–284.
H. Tamaki; T. Sato. Unfold/Fold transformation of logic programs, Proc. 2nd logic programming conference, Uppsala, Sweden, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bensaou, N., Guessarian, I. (1994). Transforming constraint logic programs. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_129
Download citation
DOI: https://doi.org/10.1007/3-540-57785-8_129
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57785-0
Online ISBN: 978-3-540-48332-8
eBook Packages: Springer Book Archive