Sciweavers

209 search results - page 8 / 42
» Termination of Priority Rewriting
Sort
View
FOSSACS
2004
Springer
14 years 1 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
AISC
2004
Springer
13 years 11 months ago
Polynomial Interpretations with Negative Coefficients
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...
Nao Hirokawa, Aart Middeldorp
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 7 months ago
Termination orders for 3-dimensional rewriting
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
Yves Guiraud
RTA
2004
Springer
14 years 1 months ago
TORPA: Termination of Rewriting Proved Automatically
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
Hans Zantema
ENTCS
2000
80views more  ENTCS 2000»
13 years 7 months ago
Behavioral and Coinductive Rewriting
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
Joseph A. Goguen, Kai Lin, Grigore Rosu