Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

AISC
2004
Springer

favoriteEmaildiscussreport

134views Artificial Intelligence» more AISC 2004»

Polynomial Interpretations with Negative Coefficients

13 years 8 months ago

Polynomial Interpretations with Negative Coefficients

Download www.jaist.ac.jp

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.

Nao Hirokawa, Aart Middeldorp

Real-time Traffic

AISC 2004 | Artificial Intelligence | Function Symbol | Polynomial Interpretations | Rewrite Systems |

claim paper

Related Content

» On extensions of a theorem of Baxter

» Monotonicity Criteria for Polynomial Interpretations over the Naturals

» Explicit factors of some iterated resultants and discriminants

» Indexing SpatioTemporal Trajectories with Chebyshev Polynomials

» Handling Nonlinear Polynomial Queries over Dynamic Data

» Tyrolean termination tool Techniques and features

» ProofTheoretic Approach to DescriptionLogic

» Ordering Constraints over Feature Trees

» Evaluation of a Novel Metric for Quality Control in an RNA Interference High Throughput Sc...

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2004
Where	AISC
Authors	Nao Hirokawa, Aart Middeldorp

Comments (0)