Recurrence with affine level mappings is P-time decidable for CLP(R)

Details Recurrence with affine level mappings is P-time decidable for CLP(R) Recurrence with affine level mappings is P-time decidable for CLP(R)

2007-01-12

arxiv.org/abs/cs/0701082v1

Computer Science

Programming Languages

To appear in Theory and Practice of Logic Programming (TPLP)

Scientific paper

In this paper we introduce a class of constraint logic programs such that
their termination can be proved by using affine level mappings. We show that
membership to this class is decidable in polynomial time.

Affiliated with

Also associated with

No associations

Rating

Recurrence with affine level mappings is P-time decidable for CLP(R) 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 Recurrence with affine level mappings is P-time decidable for CLP(R), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recurrence with affine level mappings is P-time decidable for CLP(R) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-218167