Generalized Sufficient Conditions for Modular Termination of Rewriting.

Bernhard Gramlich

Published in: Appl. Algebra Eng. Commun. Comput. (1994)

Keyphrases

sufficient conditions
termination analysis
fixed point
asymptotic stability
exponential stability
active rules
linear complementarity problem
rewrite rules
linear systems
genetic algorithm
linear programming
lyapunov function
asymptotic optimality
efficiently computable