Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  refine matrix interpretations for proving termination and complexity bounds of term rewrite systems  restricting them to domains that satisfy a system of linear inequalities. Admissibility of such a restriction is shown by certificates whose validity can be expressed as a constraint program. This refinement is orthogonal to other features of matrix interpretations (complexity bounds, dependency pairs), but can be used to improve complexity bounds,  and  discuss its relation with the usable rules criterion.  present an implementation and experiments.
['Johannes Waldmann']
I am writing a research paper on a idea Matrix Interpretations on Polyhedral Domains.
[{"from": "human", "value": "I am writing a research paper on a idea Matrix Interpretations on Polyhedral Domains."}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  refine matrix interpretations for proving termination and complexity bounds of term rewrite systems  restricting them to domains that satisfy a system of linear inequalities. Admissibility of such a restriction is shown by certificates whose validity can be expressed as a constraint program. This refinement is orthogonal to other features of matrix interpretations (complexity bounds, dependency pairs), but can be used to improve complexity bounds,  and  discuss its relation with the usable rules criterion.  present an implementation and experiments."}]