Decreasing diagrams and relative termination

DOI10.1007/978-3-642-14203-1_41MaRDI QIDQ5747786zbMATH OpenOpenAlexFDO

Authors Nao Hirokawa, Aart Middeldorp

Publication date 14 September 2010

Published in Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14203-1_41

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Decreasing diagrams and relative termination
• Labelings for Decreasing Diagrams.
• Labelings for decreasing diagrams
• Proving confluence of term rewriting systems via persistency and decreasing diagrams
• Automated confluence proof by decreasing diagrams based on rule-labelling

Cites work

• A geometric proof of confluence by decreasing diagrams
• Confluence by Decreasing Diagrams
• Confluence by decreasing diagrams
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Developing developments
• Diagram techniques for confluence
• Diagrammatic Confluence and Completion
• Generalizing Newman’s Lemma for Left-Linear Rewrite Systems
• scientific article; zbMATH DE number 4106267 (Why is no real title available?)
• scientific article; zbMATH DE number 1543072 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• KBO orientability
• Matrix interpretations for proving termination of term rewriting
• Modular properties of composable term rewriting systems
• On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
• Proving Confluence of Term Rewriting Systems Automatically
• Solving Partial Order Constraints for LPO Termination
• Term Rewriting and Applications
• Theory and Applications of Satisfiability Testing
• Tree-Manipulating Systems and Church-Rosser Theorems

Cited in

(9)

• Labelings for decreasing diagrams
• Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks
• Decreasing diagrams and relative termination
• Decreasing diagrams with two labels are complete for confluence of countable systems
• Decreasing diagrams for confluence and commutation
• Proving confluence of term rewriting systems via persistency and decreasing diagrams
• Labelings for Decreasing Diagrams.
• Automated confluence proof by decreasing diagrams based on rule-labelling
• Decreasing Diagrams II

This page was built for publication: Decreasing diagrams and relative termination

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