The following pages link to (Q3028369):
Displaying 11 items.
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- A completion procedure for conditional equations (Q758211) (← links)
- On the modelling of search in theorem proving -- towards a theory of strategy analysis (Q1281504) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- On using ground joinable equations in equational theorem proving (Q1404987) (← links)
- Induction using term orders (Q1915132) (← links)
- Improving transformation systems for general E-unification (Q5055788) (← links)
- Completion of first-order clauses with equality by strict superposition (Q5881276) (← links)
- Unification in a combination of equational theories: an efficient algorithm (Q6488538) (← links)
- Ordered rewriting and confluence (Q6488545) (← links)
- On restrictions of ordered paramodulation with simplification (Q6488549) (← links)
