Acceptability with general orderings

Details Acceptability with general orderings Acceptability with general orderings

2001-06-26

arxiv.org/abs/cs/0106052v1

Computer Science

Programming Languages

To appear in "Computational Logic: From Logic Programming into the Future"

Scientific paper

We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general orderings (instead of level mappings), like it is done in transformational approaches to logic program termination analysis, but we apply these orderings directly to the logic program and not to the term-rewrite system obtained through some transformation. We define some variants of acceptability, based on general orderings, and show how they are equivalent to LD-termination. We develop a demand driven, constraint-based approach to verify these acceptability-variants. The advantage of the approach over standard acceptability is that in some cases, where complex level mappings are needed, fairly simple orderings may be easily generated. The advantage over transformational approaches is that it avoids the transformation step all together. {\bf Keywords:} termination analysis, acceptability, orderings.

Affiliated with

Also associated with

No associations

Rating

Acceptability with general orderings 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 Acceptability with general orderings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Acceptability with general orderings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-641885