Decreasing diagrams and relative termination

DOI10.1007/978-3-642-14203-1_41zbMATH Open1291.68347OpenAlexW1609605580MaRDI QIDQ5747786FDOQ5747786

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

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

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

Cited In (7)

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

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)