Matrix Interpretations for Proving Termination of Term Rewriting
From MaRDI portal
(Redirected from Publication:3613435)
Recommendations
- Matrix interpretations for proving termination of term rewriting
- Improved matrix interpretation
- Revisiting matrix interpretations for proving termination of term rewriting
- Termination of String Rewriting with Matrix Interpretations
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations
Cited in
(23)- Tuple interpretations for termination of term rewriting
- Multi-dimensional interpretations for termination of term rewriting
- Termination by Quasi-periodic Interpretations
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations
- Automatic Termination
- Automatic synthesis of logical models for order-sorted first-order theories
- Termination of graph transformation systems using weighted subgraph counting
- Normalization of Infinite Terms
- Search Techniques for Rational Polynomial Orders
- Root-Labeling
- On probabilistic term rewriting
- Improved matrix interpretation
- Revisiting matrix interpretations for proving termination of term rewriting
- Compression of rewriting systems for termination analysis
- Arctic Termination ...Below Zero
- Maximal Termination
- Tyrolean termination tool: techniques and features
- Matrix interpretations for proving termination of term rewriting
- Proving Termination with (Boolean) Satisfaction
- Termination of String Rewriting with Matrix Interpretations
- From Outermost to Context-Sensitive Rewriting
- Termination Analysis of Logic Programs Based on Dependency Graphs
- Proving Infinitary Normalization
This page was built for publication: Matrix Interpretations for Proving Termination of Term Rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613435)
