Decreasing Diagrams and Relative Termination

Details Decreasing Diagrams and Relative Termination Decreasing Diagrams and Relative Termination

2009-10-15

arxiv.org/abs/0910.2853v3

Computer Science

Logic in Computer Science

v3: missing references added

Scientific paper

In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair steps are relatively terminating with respect to R. We further show how to encode the rule-labeling heuristic for decreasing diagrams as a satisfiability problem. Experimental data for both methods are presented.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-620102