Termination Modulo Combinations of Equational Theories
Rewriting with rules R modulo axioms E is a widely used technique in both rule-based programming languages and in automated deduction. Termination methods for rewriting systems modulo specific axioms E (e.g., associativity-commutativity) are known. However, much less seems to be known about termination methods that can be modular in the set E of axioms. In fact, current termination tools and proof methods cannot be applied to commonly occurring combinations of axioms that fall outside their scope. This work proposes a modular termination proof method based on semantics- and termination-preserving transformations that can reduce the proof of termination of rules R modulo E to an equivalent proof of termination of the transformed rules modulo a typically much simpler set B of axioms. Our method is based on the notion of variants of a term recently proposed by Comon and Delaune. We illustrate its practical usefulness by considering the very common case in which E is an arbitrary combination of associativity, commutativity, left- and right-identity axioms for various function symbols.
Unable to display preview. Download preview PDF.
- 1.Baader, F., Schulz, K.U.: Unification Theory. In: Automated Deduction. Applied Logic Series, vol. I, 8, pp. 225–263. Kluwer, Dordrecht (1998)Google Scholar
- 7.Durán, F., Lucas, S., Meseguer, J.: Termination Modulo Combinations of Equational Theories (Long Version). University of Illinois Tech. Rep. (June 2009), http://hdl.handle.net/2142/12311
- 10.Escobar, S., Meseguer, J., Sasse, R.: Variant Narrowing and Equational Unification. In: Proc. of WRLA 2008. ENTCS (2008) (to appear, 2009)Google Scholar
- 11.Escobar, S., Meseguer, J., Sasse, R.: Variant Narrowing and Extreme Termination. University of Illinois Tech. Rep. UIUCDCS-R-2009-3049 (March 2009)Google Scholar
- 20.Lucas, S., Meseguer, J.: Operational Termination of Membership Equational Programs: the Order-Sorted Way. In: Proc. of WRLA 2008. ENTCS (2008) (to appear, 2009)Google Scholar
- 21.Marché, C.: Normalised rewriting and normalised completion. In: Proc. LICS 1994, pp. 394–403. IEEE, Los Alamitos (1994)Google Scholar