TítuloWell-Nested Context Unification
Publication TypeConference Paper
Year of Publication2005
AuthorsLevy J, Niehren J, Villaret M
Conference NameLecture Notes in Artificial Intelligence
Volume3632
EditorialSpringer-Verlag
Paginación149-163
Resumen

Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU –well-nested CU– and present a new unification algorithm that solves well-nested context equations in non-deterministic polynomial time. We show that minimal well-nested solutions of context equations can be composed from the material present in the equation (see Theorem 1). This property is wishful when modeling natural language ellipsis in CU.