cl-banner

Polynomial Interpretations with Negative Coefficients

Nao Hirokawa and Aart Middeldorp

Proceedings of the 7th International Conference on Artificial Intelligence and Symbolic Mathematical Computation (AISC 2004), Lecture Notes in Artificial Intelligence 3249, pp. 185 – 198, 2004.

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.

 

  PDF |    doi:10.1007/b100361  |  ©  Springer

BibTeX 

@inproceedings{HM-AISC04,
author = "Nao Hirokawa and Aart Middeldorp",
title = "Polynomial Interpretations with Negative Coefficients",
booktitle = "Proceedings of the 7th International Conference on Artificial Intelligence and
Symbolic Mathematical Computation",
series = "Lecture Notes in Artificial Intelligence",
volume = 3249,
publisher = "Springer-Verlag",
year = 2004,
pages = "185--198"
}
Nach oben scrollen