Arctic Termination ...Below Zero

DOI10.1007/978-3-540-70590-1_14zbMATH1145.68450OpenAlexW1504878076MaRDI QIDQ3522019FDOQ3522019

Authors Adam Koprowski, Johannes Waldmann

Publication date 28 August 2008

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70590-1_14

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Max/Plus tree automata for termination of term rewriting
• Matrix interpretations for proving termination of term rewriting
• Matrix Interpretations for Proving Termination of Term Rewriting
• Automatic Termination
• Certification of Proving Termination of Term Rewriting by Matrix Interpretations

Cites work

• scientific article; zbMATH DE number 2182486 (Why is no real title available?)
• scientific article; zbMATH DE number 1358710 (Why is no real title available?)
• scientific article; zbMATH DE number 3222127 (Why is no real title available?)
• Arctic Termination ...Below Zero
• Artificial Intelligence and Symbolic Computation
• Certification of Proving Termination of Term Rewriting by Matrix Interpretations
• Interacting with Modal Logics in the Coq Proof Assistant
• Matrix Interpretations for Proving Termination of Term Rewriting
• Methods and applications of \((\max,+)\) linear algebra
• Modular termination proofs for rewriting using dependency pairs
• Proving Termination by Bounded Increase
• TPA: Termination Proved Automatically
• Termination by Quasi-periodic Interpretations
• Termination of String Rewriting with Matrix Interpretations
• Termination of term rewriting using dependency pairs
• Termination proofs and the length of derivations
• The equality problem for rational series with multiplicities in the tropical semiring is undecidable
• Theory and Applications of Satisfiability Testing
• Tyrolean termination tool: techniques and features
• Weighted automata for proving termination of string rewriting

Cited in

(11)

• KBO orientability
• Joint spectral radius theory for automated complexity analysis of rewrite systems
• Proving termination of graph transformation systems using weighted type graphs over semirings
• Increasing interpretations
• Increasing Interpretations
• Arctic Termination ...Below Zero
• The Derivational Complexity Induced by the Dependency Pair Method
• Automatic Termination
• Termination of cycle rewriting by transformation and matrix interpretation
• Max/Plus tree automata for termination of term rewriting
• CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verifications of termination certificates

Describes a project that uses

Uses Software

• Coq

This page was built for publication: Arctic Termination ...Below Zero

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522019)