Satisfying KBO Constraints

Details Satisfying KBO Constraints Satisfying KBO Constraints

2006-08-06

arxiv.org/abs/cs/0608032v2

Computer Science

Symbolic Computation

15 pages

Scientific paper

This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for the precedence are encoded in (pseudo-)propositional logic and the resulting formula is tested for satisfiability. Any satisfying assignment represents a weight function and a precedence such that the induced Knuth-Bendix order orients the rules of the encoded rewrite system from left to right.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-394246