41st Meeting of the Association of Computational Linguistics, pp. 367-374, July 2003

Minimal Recursion Semantics (MRS) is the standard formalism used in large-scale HPSG grammars to model underspecified semantics. We
present the first provably efficient algorithm to enumerate the
readings of MRS structures. It is obtained by translating MRS
into normal dominance constraints for which efficient
algorithms exist.