Increasing Interpretations

DOI10.1007/978-3-540-85110-3_16MaRDI QIDQ5505499zbMATH OpenOpenAlexFDO

Authors 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

implementations of symbolic computation systemslogic and symbolic computing

Mathematics Subject Classification ID

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

Recommendations

• Increasing interpretations
• Tuple interpretations for termination of term rewriting
• scientific article; zbMATH DE number 1722702
• Termination of term rewriting by interpretation
• Maximal Termination

Cites work

• Arctic Termination ...Below Zero
• Artificial Intelligence and Symbolic Computation
• Automating the dependency pair method
• Matrix interpretations for proving termination of term rewriting
• Mechanizing and improving dependency pairs
• On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
• 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
• Rewriting Techniques and Applications
• SAT Solving for Termination Analysis with Polynomial Interpretations
• 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

(3)

• Increasing interpretations
• Tuple interpretations for termination of term rewriting
• KBO orientability

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 Q5505499)