Jun 9, 2005 · We extend the Tamaki-Sato transformation system for logic programs into a transformation system for constraint logic programs including fold ...

Logic programming has been extended to constraint logic programming to inte- grate the resolution of numerical, boolean or set-theoretical constraints ...

The Tamaki-Sato transformation system is extended into a transformation system for constraint logic programs including fold, unfold, replacement, ...

TL;DR: The Tamaki-Sato transformation system is extended into a transformation system for constraint programs including fold-unfold, substitution, thinning and ...

We propose a transformation system for Constraint Logic Programming (CLP) aprograms and modules. The framework is inspired by the one of Tamaki and Sato (1984)

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...

The modular framework defined here for logic programming consists of a small number of operations over modules which are (meta-) logically defined and ...

In this paper we study unfold/fold transformations for constraint logic programs (CLP) with dynamic scheduling and for concurrent constraint programming ...

Abstract. We propose a transformation system for Constraint Logic Programming (CLP) programs and modules. The framework is inspired by the one of Tamaki and ...

In this paper we study unfold/fold transformations for constraint logic programs (CLP) with dynamic scheduling and for concurrent constraint programming (ccp).