Pages that link to "Item:Q3522004"
From MaRDI portal
The following pages link to Rewriting Techniques and Applications (Q3522004):
Displaying 23 items.
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities (Q3522029) (← links)
- Unification, weak unification, upper bound, lower bound, and generalization problems (Q5055751) (← links)
- Adding homomorphisms to commutative/monoidal theories or how algebra can help in equational unification (Q5055754) (← links)
- Goal directed strategies for paramodulation (Q5055756) (← links)
- Proofs in parameterized specifications (Q5055758) (← links)
- Modular higher-order E-unification (Q5055760) (← links)
- Program transformation and rewriting (Q5055762) (← links)
- Redundancy criteria for constrained completion (Q5055781) (← links)
- Distributing equational theorem proving (Q5055785) (← links)
- On the correctness of a distributed memory Gröbner basis algorithm (Q5055786) (← links)
- Improving transformation systems for general E-unification (Q5055788) (← links)
- Combination techniques and decision problems for disunification (Q5055803) (← links)
- Extension of the associative path ordering to a chain of associative commutative symbols (Q5055809) (← links)
- More problems in rewriting (Q5055812) (← links)
- Substitution tree indexing (Q5055823) (← links)
- Some independence results for equational unification (Q5055843) (← links)
- Regular substitution sets: A means of controlling E-unification (Q5055844) (← links)
- Problems in rewriting III (Q5055847) (← links)
- Fine-grained concurrent completion (Q5055848) (← links)
- Termination of constructor systems (Q5055852) (← links)
- An algorithm for distributive unification (Q5055867) (← links)
- Efficient second-order matching (Q5055870) (← links)
