Search techniques for rational polynomial orders

10Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interpretations with polynomials over the naturals. But recently, it was shown that interpretations with polynomials over the rationals can be significantly more powerful. However, searching for such interpretations is considerably more difficult than for natural polynomials. Moreover, while there exist highly efficient SAT-based techniques for finding natural polynomials, no such techniques had been developed for rational polynomials yet. In this paper, we tackle the two main problems when applying rational polynomial interpretations in practice: (1) We develop new criteria to decide when to use rational instead of natural polynomial interpretations. (2) Afterwards, we present SAT-based methods for finding rational polynomial interpretations and evaluate them empirically. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Fuhs, C., Navarro-Marset, R., Otto, C., Giesl, J., Lucas, S., & Schneider-Kamp, P. (2008). Search techniques for rational polynomial orders. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5144 LNAI, pp. 109–124). https://doi.org/10.1007/978-3-540-85110-3_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free