The following pages link to (Q3338215):
Displaying 18 items.
- Mark Stickel: his earliest work (Q287332) (← links)
- The theory of idempotent semigroups is of unification type zero (Q581000) (← links)
- Matching - a special case of unification? (Q582272) (← links)
- On unification: Equational theories are not bounded (Q1094131) (← links)
- A class of confluent term rewriting systems and unification (Q1101209) (← links)
- Finite generation of ambiguity in context-free languages (Q1117043) (← links)
- Inheritance hierarchies: Semantics and unifications (Q1124313) (← links)
- Complete sets of transformations for general E-unification (Q1262754) (← links)
- Unification problem in equational theories (Q1280985) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- On equational theories, unification, and (un)decidability (Q1825184) (← links)
- What Is Essential Unification? (Q3305325) (← links)
- IMPLEMENTING COMPLEX DOMAINS OF APPLICATION IN AN EXTENDED PROLOG SYSTEM (Q3835050) (← links)
- (Q3994022) (← links)
- Combining matching algorithms: The regular case (Q5055731) (← links)
- Rewriting, and equational unification: the higher-order cases (Q5055746) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Propositional calculus problems in CHIP (Q5096196) (← links)
