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. © Springer-Verlag 2004.
Cite
CITATION STYLE
APA
Hirokawa, N., & Middeldorp, A. (2004). Polynomial Interpretations with Negative Coefficients. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3249, 185–198. https://doi.org/10.1007/978-3-540-30210-0_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free