Matrix Interpretations for Proving Termination of Term Rewriting
From MaRDI portal
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
(22)- Certification of Proving Termination of Term Rewriting by Matrix Interpretations
- Improved matrix interpretation
- Tyrolean termination tool: techniques and features
- Termination Analysis of Logic Programs Based on Dependency Graphs
- Normalization of Infinite Terms
- Proving Infinitary Normalization
- Arctic Termination ...Below Zero
- Maximal Termination
- Compression of rewriting systems for termination analysis
- Proving Termination with (Boolean) Satisfaction
- From Outermost to Context-Sensitive Rewriting
- Revisiting matrix interpretations for proving termination of term rewriting
- Matrix interpretations for proving termination of term rewriting
- On probabilistic term rewriting
- Search Techniques for Rational Polynomial Orders
- Automatic Termination
- Tuple interpretations for termination of term rewriting
- Root-Labeling
- Automatic synthesis of logical models for order-sorted first-order theories
- Termination of String Rewriting with Matrix Interpretations
- Termination by Quasi-periodic Interpretations
- Multi-dimensional interpretations for termination of term rewriting
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)
