Confluence by critical pair analysis
From MaRDI portal
Recommendations
Cited in
(21)- Confluence of indirection reductions in graph rewrite systems
- Confluence by critical pair analysis revisited
- A reduction-preserving completion for proving confluence of non-terminating term rewriting systems
- Confluence of non-left-linear TRSs via relative termination
- Non-E-overlapping, weakly shallow, and non-collapsing TRSs are confluent
- Reducing relative termination to dependency pair problems
- Generalizing Newman’s Lemma for Left-Linear Rewrite Systems
- scientific article; zbMATH DE number 3928346 (Why is no real title available?)
- scientific article; zbMATH DE number 4051589 (Why is no real title available?)
- scientific article; zbMATH DE number 2043517 (Why is no real title available?)
- Confluence of layered rewrite systems
- A reduction-preserving completion for proving confluence of non-terminating term rewriting systems
- Confluent term rewriting for only-knowing logics
- scientific article; zbMATH DE number 3106708 (Why is no real title available?)
- Confluence without termination via parallel critical pairs
- Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs
- Testing confluence of nonterminating rewriting systems
- Compositional confluence criteria
- Simultaneous CONCORG analysis: the CONCORGS method
- Confluence for graph transformations
- Confluence and termination of fuzzy relations
This page was built for publication: Confluence by critical pair analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170823)