We propose a set of transformation rules for constraint logic programs with negation. We assume that every program is locally stratified and, thus, it has a unique perfect model. We give sufficient conditions which ensure that the proposed set of transformation rules preserves the perfect model of the programs. Our rules extend in some respects the rules for logic programs and constraint logic programs already considered in the literature and, in particular, they include a rule for unfolding a clause with respect to a negative literal.
Pettorossi, A., Proietti, M. (2004). Transformation rules for locally stratified constraint logic programs. In Maurice Bruynooghe and Kung-Kiu Lau (Eds.) (a cura di), Program development in computational logic (pp. 291-339). Berlin : Springer [10.1007/978-3-540-25951-0_10].
Transformation rules for locally stratified constraint logic programs
PETTOROSSI, ALBERTO;
2004-01-01
Abstract
We propose a set of transformation rules for constraint logic programs with negation. We assume that every program is locally stratified and, thus, it has a unique perfect model. We give sufficient conditions which ensure that the proposed set of transformation rules preserves the perfect model of the programs. Our rules extend in some respects the rules for logic programs and constraint logic programs already considered in the literature and, in particular, they include a rule for unfolding a clause with respect to a negative literal.| File | Dimensione | Formato | |
|---|---|---|---|
|
Fio_Pet_Pro_LOPSTR_bookREVISED.pdf
accesso aperto
Dimensione
1.24 MB
Formato
Adobe PDF
|
1.24 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
