The following pages link to (Q3811749):
Displaying 6 items.
- A fast algorithm for generating reduced ground rewriting systems from a set of ground equations (Q689111) (← links)
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems (Q918215) (← links)
- Algorithms and reductions for rewriting problems. II. (Q1853144) (← links)
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time (Q4033833) (← links)
- Efficient ground completion (Q5055736) (← links)
- Any ground associative-commutative theory has a finite canonical system (Q5055779) (← links)
