Robert Weida and Diane Lit-man. Terminological reasoning with constraint networks and an application to plan recognition. In Proc. (a)g where S { called the Step Interpretation { is a function associating a newly generated function to each interval introduced by a decomposition operator. The representation of the Double-Stack plan in the extended language is: Double-Stack : = 3(x y) (x d ])(y d...

We consider the natural generalization of Alexeev and Knutson's stack of branchvarieties to the case of a Deligne-Mumford stack. The main results are a proof that the stack of branchvarieties is always algebraic, that limits of one-dimensional families always exist, and that the connected components of the stack of branchvarieties are proper over the base under certain hypotheses on the ambient...