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. © Springer-Verlag 2004.
CITATION STYLE
Fioravanti, F., Pettorossi, A., & Proietti, M. (2004). Transformation rules for locally stratified constraint logic programs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3049, 291–339. https://doi.org/10.1007/978-3-540-25951-0_10
Mendeley helps you to discover research relevant for your work.