Transformation Rules for Locally Stratified Constraint Logic Programs

Details Transformation Rules for Locally Stratified Constraint Logic Programs Transformation Rules for Locally Stratified Constraint Logic Programs

2004-02-20

arxiv.org/abs/cs/0402048v1

Computer Science

Programming Languages

To appear in: M. Bruynooghe, K.-K. Lau (Eds.) Program Development in Computational Logic, Lecture Notes in Computer Science, S

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Transformation Rules for Locally Stratified Constraint Logic Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Transformation Rules for Locally Stratified Constraint Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transformation Rules for Locally Stratified Constraint Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-709186