Abstract
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. We show how polynomial interpretations with negative coefficients, like x–1 for a unary function symbol or x–y for a binary function symbol, can be used to extend the class of rewrite systems that can be automatically proved terminating.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have