Decreasing diagrams and relative termination
From MaRDI portal
Publication:5747786
Recommendations
Cites work
- 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?)
- 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
- 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
(7)- Decreasing diagrams and relative termination
- Decreasing diagrams with two labels are complete for confluence of countable systems
- Labelings for Decreasing Diagrams.
- 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)