234 search results - page 11 / 47 » Deduction, Strategies, and Rewriting |
ALP
1994
Springer
13 years 11 months ago
1994
Springer
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present ...
BIRTHDAY
2007
Springer
14 years 1 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
WADT
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...