UNIF 2012: Keyword Index

Keyword	Papers
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