B |

Bounded unification | Bounded Higher-order Unification using Regular Terms |

bounded unification algorithms | Bounded Higher-order Unification using Regular Terms |

C |

Computing Unifiers | Recent Advances in Unification for the EL Family |

D |

Description Logics | Recent Advances in Unification for the EL Family |

E |

El Gamal Signature Scheme | The use of types in designing unification algorithms: two case studies |

Equational Unification | The use of types in designing unification algorithms: two case studies Some Notes on Basic Syntactic Mutation |

Exponent of periodicity | Bounded Higher-order Unification using Regular Terms |

G |

General Concept Inclusions | Recent Advances in Unification for the EL Family |

H |

higher-order unification | Bounded Higher-order Unification using Regular Terms |

M |

Minimal Unifiers | Recent Advances in Unification for the EL Family |

R |

regular terms | Bounded Higher-order Unification using Regular Terms |

S |

subterm-collapse | Some Notes on Basic Syntactic Mutation |

T |

term rewriting | Some Notes on Basic Syntactic Mutation |

Term Rewriting Systems | Some Notes on Basic Syntactic Mutation |

type systems | The use of types in designing unification algorithms: two case studies |

U |

unification | Recent Advances in Unification for the EL Family |

unification modulo convergent term rewrite systems | Some Notes on Basic Syntactic Mutation |