The following pages link to Termination by completion (Q757069):
Displaying 23 items.
- Abstract abstract reduction (Q817587) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- REVEUR-3: The implementation of a general completion procedure parameterized by built-in theories and strategies (Q1097686) (← links)
- Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← links)
- Termination of rewrite systems by elementary interpretations (Q1805401) (← links)
- Proof of termination of the rewriting system SUBSET on CCL (Q1822494) (← links)
- An improved general path order (Q1925013) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- Finding small counterexamples for abstract rewriting properties (Q4585013) (← links)
- Transforming termination by self-labelling (Q4647535) (← links)
- Completion-time optimization of rewrite-time goal solving (Q5055711) (← links)
- Program transformation and rewriting (Q5055762) (← links)
- On proving properties of completion strategies (Q5055777) (← links)
- Automatic termination proofs with transformation orderings (Q5055814) (← links)
- A complete characterization of termination of 0p 1q→1r 0s (Q5055817) (← links)
- Termination of constructor systems (Q5055852) (← links)
- Dummy elimination in equational rewriting (Q5055853) (← links)
- Dummy elimination: Making termination easier (Q5055895) (← links)
- Maximal completion (Q5389074) (← links)
- Termination of processes (Q5466792) (← links)
- Term rewriting induction (Q6488529) (← links)
