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.
Cite
CITATION STYLE
Bensaou, N., & Guessarian, I. (1994). Transforming constraint logic programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 775 LNCS, pp. 33–46). Springer Verlag. https://doi.org/10.1007/3-540-57785-8_129
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
