@InProceedings{Koller_et_al:1999,
      AUTHOR = {Koller, Alexander and Niehren, Joachim and Striegnitz, Kristina},
      TITLE = {Relaxing Underspecified Semantic Representations for Reinterpretation},
      YEAR = {1999},
      BOOKTITLE = {6th Meeting on Mathematics of Language (MOL6), July 23-25},
      PAGES = {74-87},
      ADDRESS = {Orlando, Florida, USA},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Relax99.ps.gz},
      ABSTRACT = {Type and sort conflicts in semantics are usually resolved by a process of reinterpretation. Recently, Egg (1999) has proposed an alternative account in which conflicts are avoided by underspecification. The main idea is to derive sufficiently relaxed underspecified semantic representations; addition of reinterpretation operators then simply is further specialization. But in principle, relaxing underspecified representations bears the danger of overgeneration. In this paper, we investigate this problem in the framework of CLLS, where underspecified representations are expressed by tree descriptions subsuming dominance constraints. We introduce some novel properties of dominance constraints and present a safety criterion that ensures that an underspecified description can be relaxed without adding unwanted readings. We then apply this criterion systematically to Egg's analysis and show why its relaxation operation does not lead to overgeneration.},
      ANNOTE = {COLIURL : Koller:1999:RUS.pdf Koller:1999:RUS.ps}
}