Transformation Rules for Locally Stratified Constraint Logic Programs
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.
 Publication:

arXiv eprints
 Pub Date:
 February 2004
 arXiv:
 arXiv:cs/0402048
 Bibcode:
 2004cs........2048F
 Keywords:

 Computer Science  Programming Languages;
 Computer Science  Logic in Computer Science;
 D.1.2;
 D.1.6;
 I.2.2;
 F.3.1
 EPrint:
 To appear in: M. Bruynooghe, K.K. Lau (Eds.) Program Development in Computational Logic, Lecture Notes in Computer Science, Springer