Increasing Interpretations

DOI10.1007/978-3-540-85110-3_16zbMath1166.68381OpenAlexW2911798367MaRDI QIDQ5505499

Harald Zankl, Aart Middeldorp

Publication date: 27 January 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85110-3_16

zbMATH Keywords

logic and symbolic computingimplementations of symbolic computation systems

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Grammars and rewriting systems (68Q42)

Related Items (2)

KBO orientability ⋮ Increasing interpretations

Cites Work

• Tyrolean termination tool: techniques and features
• On tree automata that certify termination of left-linear term rewriting systems
• Mechanizing and improving dependency pairs
• Matrix interpretations for proving termination of term rewriting
• Testing positiveness of polynomials
• Termination of term rewriting using dependency pairs
• Automating the dependency pair method
• On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
• Arctic Termination ...Below Zero
• SAT Solving for Termination Analysis with Polynomial Interpretations
• Theory and Applications of Satisfiability Testing
• Proving Termination of Rewrite Systems Using Bounds
• Termination by Quasi-periodic Interpretations
• Artificial Intelligence and Symbolic Computation
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Rewriting Techniques and Applications

This page was built for publication: Increasing Interpretations