The following pages link to Basic narrowing revisited (Q1824412):
Displayed 11 items.
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- The disconnection tableau calculus (Q877889) (← links)
- On completeness of narrowing strategies (Q912605) (← links)
- Conditional equational theories and complete sets of transformations (Q918541) (← links)
- Enumerating outer narrowing derivations for constructor-based term rewriting systems (Q1124376) (← links)
- Complete sets of transformations for general E-unification (Q1262754) (← links)
- Completeness results for basic narrowing (Q1328184) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- Theorem proving modulo (Q1431339) (← links)
- Combination problems for commutative/monoidal theories or how algebra can help in equational unification (Q1919702) (← links)