The following pages link to Term Rewriting and Applications (Q5703842):
Displaying 32 items.
- Symbol different term rewrite systems (Q492918) (← links)
- Transformations and confluence for rewrite systems (Q672232) (← links)
- On ground-confluence of term rewriting systems (Q913496) (← links)
- Overlap closures do not suffice for termination of general term rewriting systems (Q922713) (← links)
- Murg term rewrite systems (Q975468) (← links)
- Confluence and termination of fuzzy relations (Q991880) (← links)
- A class of confluent term rewriting systems and unification (Q1101209) (← links)
- Fuzzy term-rewriting system (Q1182011) (← links)
- Some results on the confluence property of combined term rewriting systems (Q1337642) (← links)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- Remarks on Thatte's transformation of term rewriting systems (Q1763376) (← links)
- Right-linear half-monadic term rewrite systems (Q1884902) (← links)
- Bounded, strongly sequential and forward-branching term rewriting systems (Q1892142) (← links)
- Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting system (Q1901710) (← links)
- Confluence of curried term-rewriting systems (Q1907275) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- Confluence of orthogonal term rewriting systems in the prototype verification system (Q2362205) (← links)
- Complete involutive rewriting systems (Q2466871) (← links)
- Shallow confluence of conditional term rewriting systems (Q2518609) (← links)
- A reduction-preserving completion for proving confluence of non-terminating term rewriting systems (Q2881099) (← links)
- Confluence of Non-Left-Linear TRSs via Relative Termination (Q2891456) (← links)
- Proving Confluence of Term Rewriting Systems Automatically (Q3636821) (← links)
- Finite canonical rewriting systems for congruences generated by concurrency relations (Q3779772) (← links)
- (Q3780426) (← links)
- (Q3819993) (← links)
- (Q4506400) (← links)
- On confluence for weakly normalizing systems (Q5055761) (← links)
- Confluence of terminating conditional rewrite systems revisited (Q5055864) (← links)
- Confluence without termination via parallel critical pairs (Q5878911) (← links)
- Extended term rewriting systems (Q5881265) (← links)
- Testing confluence of nonterminating rewriting systems (Q5881272) (← links)
- A general theory of confluent rewriting systems for logic programming and its applications (Q5935989) (← links)