Termination proofs and the length of derivations
From MaRDI portal
Publication:5055719
DOI10.1007/3-540-51081-8_107zbMath1503.68116OpenAlexW1597089442MaRDI QIDQ5055719
Clemens Lautemann, Dieter Hofbauer
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-51081-8_107
Related Items
Type removal in term rewriting, A combination framework for complexity, On Subquadratic Derivational Complexity of Semi-Thue Systems, Incremental termination proofs and the length of derivations, Time bounded rewrite systems and termination proofs by generalized embedding, Automatic synthesis of logical models for order-sorted first-order theories, Lower bounds for runtime complexity of term rewriting, Analyzing Innermost Runtime Complexity Through Tuple Interpretations, An upper bound on the derivational complexity of Knuth-Bendix orderings., Analysing parallel complexity of term rewriting, Arctic Termination ...Below Zero, Proving Quadratic Derivational Complexities Using Context Dependent Interpretations, The derivational complexity of string rewriting systems, Automated Implicit Computational Complexity Analysis (System Description), Automated Complexity Analysis Based on the Dependency Pair Method, Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, An automated approach to the Collatz conjecture, On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting, Derivation lengths and order types of Knuth--Bendix orders, Constant runtime complexity of term rewriting is semi-decidable, Complexity Analysis by Rewriting, Applications and extensions of context-sensitive rewriting, Derivational complexity and context-sensitive Rewriting, Real or natural number interpretation and their effect on complexity, Analyzing innermost runtime complexity of term rewriting by dependency pairs, Generating polynomial orderings
Cites Work
