Matrix interpretations for polynomial derivational complexity of rewrite systems

Authors:
Aart Middeldorp
Affiliations:
Institute of Computer Science, University of Innsbruck, Austria
Venue:
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2012

Citing 5
Cited 0

Termination Proofs and the Length of Derivations (Preliminary Version)

RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
On tree automata that certify termination of left-linear term rewriting systems

Information and Computation
Matrix Interpretations for Proving Termination of Term Rewriting

Journal of Automated Reasoning
Revisiting matrix interpretations for polynomial derivational complexity of term rewriting

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Joint spectral radius theory for automated complexity analysis of rewrite systems

CAI'11 Proceedings of the 4th international conference on Algebraic informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rewrite systems form an attractive model of computation. In the past decades numerous methods have been developed to prove rewrite systems terminating. Spurred by the International Termination Competition, the emphasis in recent years is on powerful methods that can be automated.