Term Rewriting and Applications
From MaRDI portal
Recommendations
- A class of confluent term rewriting systems and unification
- Confluence of curried term-rewriting systems
- scientific article; zbMATH DE number 4092756
- Confluence of algebraic rewriting systems
- Confluence of terminating conditional rewrite systems revisited
- Confluence of nearly orthogonal infinitary term rewriting systems
- scientific article; zbMATH DE number 1722716
- scientific article; zbMATH DE number 1615229
- scientific article; zbMATH DE number 4090848
- scientific article; zbMATH DE number 4043232
Cited in
(46)- A class of confluent term rewriting systems and unification
- Fuzzy term-rewriting system
- Some results on the confluence property of combined term rewriting systems
- Congruential complements of ground term rewrite systems
- Remarks on Thatte's transformation of term rewriting systems
- Right-linear half-monadic term rewrite systems
- Bounded, strongly sequential and forward-branching term rewriting systems
- Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting system
- Confluence of curried term-rewriting systems
- Modularity in term rewriting revisited
- Confluence by critical pair analysis revisited
- Confluence of orthogonal term rewriting systems in the prototype verification system
- Complete involutive rewriting systems
- Shallow confluence of conditional term rewriting systems
- scientific article; zbMATH DE number 1722716 (Why is no real title available?)
- Disproving confluence of term rewriting systems by interpretation and ordering
- 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
- CoLL: a confluence tool for left-linear term rewrite systems
- scientific article; zbMATH DE number 4164140 (Why is no real title available?)
- Generalizing Newman’s Lemma for Left-Linear Rewrite Systems
- Proving Confluence of Term Rewriting Systems Automatically
- Finite canonical rewriting systems for congruences generated by concurrency relations
- scientific article; zbMATH DE number 4043232 (Why is no real title available?)
- scientific article; zbMATH DE number 4092758 (Why is no real title available?)
- scientific article; zbMATH DE number 177827 (Why is no real title available?)
- scientific article; zbMATH DE number 1508936 (Why is no real title available?)
- A new parallel closed condition for Church-Rosser of left-linear term rewriting systems
- Symbol different term rewrite systems
- Formalising confluence in PVS
- On confluence for weakly normalizing systems
- Confluence of terminating conditional rewrite systems revisited
- Confluence by critical pair analysis
- A reduction-preserving completion for proving confluence of non-terminating term rewriting systems
- Confluence without termination via parallel critical pairs
- Extended term rewriting systems
- Testing confluence of nonterminating rewriting systems
- A general theory of confluent rewriting systems for logic programming and its applications
- Compositional confluence criteria
- Compositional confluence criteria
- Transformations and confluence for rewrite systems
- On ground-confluence of term rewriting systems
- Overlap closures do not suffice for termination of general term rewriting systems
- Murg term rewrite systems
- Confluence and termination of fuzzy relations
This page was built for publication: Term Rewriting and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703842)
