Termination of constructor systems

DOI10.1007/3-540-61464-8_43zbMATH Open1503.68085OpenAlexW2144449052MaRDI QIDQ5055852FDOQ5055852

Authors Thomas Arts, Jürgen Giesl 

Publication date 9 December 2022

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

Full work available at URL https://doi.org/10.1007/3-540-61464-8_43

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Termination by absence of infinite chains of dependency pairs
• Termination of term rewriting using dependency pairs
• Automatic termination proofs with transformation orderings
• Modular termination proofs for rewriting using dependency pairs
• Rewriting Techniques and Applications

Cites Work

• scientific article; zbMATH DE number 4041334 (Why is no real title available?)
• scientific article; zbMATH DE number 4047065 (Why is no real title available?)
• scientific article; zbMATH DE number 3702108 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 794239 (Why is no real title available?)
• scientific article; zbMATH DE number 794240 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• A note on simplification orderings
• An improved general path order
• Automatic termination proofs with transformation orderings
• CLAM
• Dummy elimination: Making termination easier
• Generating polynomial orderings
• Generating polynomial orderings for termination proofs
• InKa
• Modular proofs for completeness of hierarchical term rewriting systems
• Natural termination
• Orderings for term-rewriting systems
• Proving termination of (conditional) rewrite systems. A semantic approach
• Semantic confluence tests and completion methods
• Termination by absence of infinite chains of dependency pairs
• Termination by completion
• Termination of constructor systems
• Termination of rewriting
• Termination of rewriting systems by polynomial interpretations and its implementation
• Termination of term rewriting: Interpretation and type elimination
• The OYSTER-CLAM system

Cited In (4)

• Termination by absence of infinite chains of dependency pairs
• Termination of term rewriting using dependency pairs
• Termination of constructor systems
• Title not available (Why is no real title available?)

Uses Software

• SPIKE
• InKa
• CLAM
• Oyster

This page was built for publication: Termination of constructor systems

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