Difference between revisions of "TRS Innermost Derivational Complexity"
(Added TRS Innermost Derivational Complexity) |
(Small fixes) |
||
| Line 4: | Line 4: | ||
Analyzing the time complexity of a rewrite system is interesting because it reveals how its performance scales as input size grows. | Analyzing the time complexity of a rewrite system is interesting because it reveals how its performance scales as input size grows. | ||
| − | + | This helps to detect rewrite systems that seem fine for small inputs but become impractical for large problems. | |
Moreover, since innermost rewriting (call-by-value) is one of the most important evaluation strategies, | Moreover, since innermost rewriting (call-by-value) is one of the most important evaluation strategies, | ||
| Line 16: | Line 16: | ||
Let |t| be the size of the term t, i.e., the number of its positions. | Let |t| be the size of the term t, i.e., the number of its positions. | ||
| − | Then the <i>innermost derivation height</i> | + | Then the <i>innermost derivation height</i> idh(t) of a term t is the supremum over all innermost →<sup>i</sup><sub>R</sub>-rewrite sequences starting with t. |
| − | The <i>innermost derivational complexity</i> of an | + | The <i>innermost derivational complexity</i> of an TRS is a function that maps every natural number n |
| − | to the greatest derivation height of all objects of size at most n, i.e., | + | to the greatest derivation height of all objects of size at most n, i.e., idc<sub>→<sub>R</sub> </sub>(n) = sup{m | |t| <= n, idh(t) >= m}. |
| − | The goal is to find an asymptotic upper bound and lower bound on the derivational complexity of a given TRS R | + | The goal is to find an asymptotic upper bound and lower bound on the innermost derivational complexity idc<sub>→<sub>R</sub> </sub>(n) of a given TRS R. |
| − | |||
| − | |||
== Problem == | == Problem == | ||
| Line 33: | Line 31: | ||
* "<b>WORST_CASE(f(n),g(n))</b>" where f(n) and g(n) are lower and upper complexity bounds, respectively, or '?', followed by a proof of these bounds, e.g., a ranking function proving termination of R. | * "<b>WORST_CASE(f(n),g(n))</b>" where f(n) and g(n) are lower and upper complexity bounds, respectively, or '?', followed by a proof of these bounds, e.g., a ranking function proving termination of R. | ||
* "<b>MAYBE</b>" (indicating that the solver cannot prove any complexity bound). | * "<b>MAYBE</b>" (indicating that the solver cannot prove any complexity bound). | ||
| − | |||
| − | |||
| − | |||
[[Category:Categories]] | [[Category:Categories]] | ||
Latest revision as of 12:13, 9 June 2026
The TRS Innermost Derivational Complexity category is concerned with the question "What is the time complexity of a given TRS with relation to the size of the initial term if we only consider innermost rewriting".
Category Motivation
Analyzing the time complexity of a rewrite system is interesting because it reveals how its performance scales as input size grows. This helps to detect rewrite systems that seem fine for small inputs but become impractical for large problems.
Moreover, since innermost rewriting (call-by-value) is one of the most important evaluation strategies, it is an interesting restriction to find bounds on the innermost time complexity.
Syntax & Semantic
The syntax and the semantics of term rewrite systems are described here and here.
Formally, a term rewrite system R = {l1 → r1,...,ln → rn} is a finite set of rewrite rules.
Let |t| be the size of the term t, i.e., the number of its positions. Then the innermost derivation height idh(t) of a term t is the supremum over all innermost →iR-rewrite sequences starting with t. The innermost derivational complexity of an TRS is a function that maps every natural number n to the greatest derivation height of all objects of size at most n, i.e., idc→R (n) = sup{m | |t| <= n, idh(t) >= m}.
The goal is to find an asymptotic upper bound and lower bound on the innermost derivational complexity idc→R (n) of a given TRS R.
Problem
Input: A term rewrite system R.
Question: What is the asymptotic innermost derivational complexity of R?
Possible Outputs:
- "WORST_CASE(f(n),g(n))" where f(n) and g(n) are lower and upper complexity bounds, respectively, or '?', followed by a proof of these bounds, e.g., a ranking function proving termination of R.
- "MAYBE" (indicating that the solver cannot prove any complexity bound).
