TY  - CHAP
T2  - Dagstuhl Seminar Proceedings
ID  - eprints1381
UR  - http://drops.dagstuhl.de/opus/volltexte/2006/422/
Y1  - 2006///
AV  - none
TI  - Proofs of Program Properties via Unfold/Fold Transformations of Constraint Logic Programs
CY  - Dagstuhl, Germany
N2  - In the literature there are various papers which illustrate the relationship between the unfold/fold program transformation techniques and the proofs of program properties both in the case of logic programs and in the case of functional programs.In this paper we illustrate that relationship in the case of constraint logic programs. We build up on results already presented, i.e.,where we have considered logic programs with locally stratified negation. The constraint logic programming paradigm significantly extends the logic-programming paradigm by allowing some of the atoms to denote constraints in a suitably chosen constraint domain. By using those constraints it is often possible to get simple and direct formulations of problem solutions.
M1  - 05161
PB  - Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany
A1  - Pettorossi, Alberto
A1  - Proietti, Maurizio
A1  - Senni, Valerio
ER  -