Increasing interpretations
From MaRDI portal
Recommendations
Cites work
- Arctic Termination ...Below Zero
- Artificial Intelligence and Symbolic Computation
- Automating the dependency pair method
- Frontiers of Combining Systems
- Increasing Interpretations
- Logic for Programming, Artificial Intelligence, and Reasoning
- Matrix interpretations for proving termination of term rewriting
- Maximal Termination
- Mechanizing and improving dependency pairs
- On tree automata that certify termination of left-linear term rewriting systems
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Proving Termination of Rewrite Systems Using Bounds
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Search Techniques for Rational Polynomial Orders
- Term Rewriting and All That
- Termination by Quasi-periodic Interpretations
- Termination of term rewriting using dependency pairs
- Testing positiveness of polynomials
- Theory and Applications of Satisfiability Testing
- Tyrolean termination tool: techniques and features
Cited in
(2)
This page was built for publication: Increasing interpretations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044231)