Increasing interpretations

DOI10.1007/s10472-009-9144-7zbMath1191.68368OpenAlexW2913551129MaRDI QIDQ1044231

Harald Zankl, Aart Middeldorp

Publication date: 11 December 2009

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-009-9144-7

zbMATH Keywords

dependency graphterm rewrite systems

Mathematics Subject Classification ID

Artificial intelligence (68T99) Grammars and rewriting systems (68Q42)

Related Items (1)

SAT solving for termination proofs with recursive path orders and dependency pairs

Uses Software

• MiniSat
• Tyrolean
• AProVE
• Jambox
• Matchbox

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
• Maximal Termination
• Arctic Termination ...Below Zero
• SAT Solving for Termination Analysis with Polynomial Interpretations
• Term Rewriting and All That
• Theory and Applications of Satisfiability Testing
• Proving Termination of Rewrite Systems Using Bounds
• Termination by Quasi-periodic Interpretations
• Artificial Intelligence and Symbolic Computation
• Frontiers of Combining Systems
• Search Techniques for Rational Polynomial Orders
• Increasing Interpretations
• Logic for Programming, Artificial Intelligence, and Reasoning
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: Increasing interpretations