The following pages link to (Q3347284):
Displaying 12 items.
- On sufficient-completeness and related properties of term rewriting systems (Q1077161) (← links)
- Completion of rewrite systems with membership constraints. I: Deduction rules (Q1264438) (← links)
- Term rewrite systems for lattice theory (Q1314435) (← links)
- Partial completion of equational theories (Q1592635) (← links)
- From Hertzsprung's problem to pattern-rewriting systems (Q2109220) (← links)
- Complete involutive rewriting systems (Q2466871) (← links)
- A Completion Method to Decide Reachability in Rewrite Systems (Q2964463) (← links)
- Completeness of rewrite rules and rewrite strategies for FP (Q3476266) (← links)
- On how to move mountains ‘associatively and commutatively’ (Q5055722) (← links)
- Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation (Q5505589) (← links)
- Design strategies for rewrite rules (Q5881289) (← links)
- A Human-Oriented Term Rewriting System (Q6488090) (← links)