209 search results - page 16 / 42 » Termination of Priority Rewriting |
TMC
2008
13 years 7 months ago
2008
Abstract--In wireless ad hoc networks, in addition to the well-known hidden terminal and exposed terminal problems, the locationdependent contention may cause serious unfairness an...
PEPM
2010
ACM
13 years 9 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
IJCAI
1997
13 years 9 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions a...
DAGSTUHL
2007
13 years 9 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...