The following pages link to (Q3702510):
Displaying 15 items.
- Multi-completion with termination tools (Q352956) (← links)
- Redundancy criteria for constrained completion (Q673620) (← links)
- Theorem-proving with resolution and superposition (Q757094) (← links)
- On word problems in Horn theories (Q757095) (← links)
- A completion procedure for conditional equations (Q758211) (← links)
- Automating inductionless induction using test sets (Q758216) (← links)
- Elimination of composite superpositions may cause abortion (Q808267) (← links)
- Automated proofs of the Moufang identities in alternative rings (Q912653) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure (Q1106657) (← links)
- Critical pair criteria for completion (Q1106659) (← links)
- Unnecessary inferences in associative-commutative completion procedures (Q3489486) (← links)
- Consider only general superpositions in completion procedures (Q5055743) (← links)
- Redundancy criteria for constrained completion (Q5055781) (← links)
- On pot, pans and pudding or how to discover generalised critical Pairs (Q5210806) (← links)
