The following pages link to Notations for rewriting (Q3970984):
Displaying 19 items.
- Symbol different term rewrite systems (Q492918) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
- An improved general path order (Q1925013) (← links)
- Learning from Łukasiewicz and Meredith: investigations into proof structures (Q2055843) (← links)
- A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
- Modular and incremental automated termination proofs (Q2583289) (← links)
- Fast algorithms for uniform semi-unification (Q2643520) (← links)
- Craig interpolation with clausal first-order tableaux (Q2666953) (← links)
- What Is Essential Unification? (Q3305325) (← links)
- A case study of completion modulo distributivity and Abelian groups (Q5055783) (← links)
- Improving transformation systems for general E-unification (Q5055788) (← links)
- Automatic termination proofs with transformation orderings (Q5055814) (← links)
- Towards an efficient construction of test sets for deciding ground reducibility (Q5055821) (← links)
- E-Unification based on Generalized Embedding (Q5084482) (← links)
- Combinations of simplifying conditional term rewriting systems (Q5881179) (← links)
- A new approach to general E-unification based on conditional rewriting systems (Q5881211) (← links)
- Linear completion (Q5881280) (← links)
- Investigations into proof structures (Q6653096) (← links)
