The following pages link to (Q3664457):
Displayed 13 items.
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- Unification in combinations of collapse-free regular theories (Q1099652) (← links)
- A class of confluent term rewriting systems and unification (Q1101209) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Enumerating outer narrowing derivations for constructor-based term rewriting systems (Q1124376) (← links)
- Narrowing based procedures for equational disunification (Q1197097) (← links)
- Conditional narrowing modulo a set of equations (Q1261194) (← links)
- Schematization of infinite sets of rewrite rules generated by divergent completion processes (Q1262755) (← links)
- Complete sets of unifiers and matchers in equational theories (Q1820760) (← links)
- (Q3327710) (← links)
- Effectively Checking the Finite Variant Property (Q3522010) (← links)