The following pages link to On ground AC-completion (Q5055778):
Displaying 13 items.
- A total AC-compatible ordering based on RPO (Q673623) (← links)
- Termination and completion modulo associativity, commutativity and identity (Q1199927) (← links)
- Decidability and complexity analysis by basic paramodulation (Q1281494) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- Any ground associative-commutative theory has a finite canonical system (Q1357668) (← links)
- The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable. (Q1400708) (← links)
- On using ground joinable equations in equational theorem proving (Q1404987) (← links)
- Outermost ground termination (Q2851054) (← links)
- Complete sets of reductions modulo associativity, commutativity and identity (Q5055710) (← links)
- On how to move mountains ‘associatively and commutatively’ (Q5055722) (← links)
- On ground AC-completion (Q5055778) (← links)
- Any ground associative-commutative theory has a finite canonical system (Q5055779) (← links)
- Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties (Q6135743) (← links)
