References

[[]Althaus etal.2003]

Althaus, E., D. Duchier, A. Koller, K. Mehlhorn, J. Niehren, and S. Thiel (2003). An efficient graph algorithm for dominance constraints. Journal of Algorithms 48(1), 194–219.

[[]Blackburn and Bos2005]

Blackburn, P. and J. Bos (2005). Representation and Inference for Natural Language: A First Course in Computational Semantics. CSLI Publications.

[[]Bodirsky etal.2004]

Bodirsky, M., D. Duchier, J. Niehren, and S. Miele (2004). A new algorithm for normal dominance constraints. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA).

[[]Bos1996]

Bos, J. (1996). Predicate logic unplugged. In Proc. 10th Amsterdam Colloquium, 133–143.

[[]Copestake2002]

Copestake, A. (2002). Implementing Typed Feature Structure Grammars. Stanford, CA: CSLI Publications.

[[]Copestake and Flickinger2000]

Copestake, A. and D. Flickinger (2000). An open-source grammar development environment and broad-coverage english grammar using HPSG. In Conference on Language Resources and Evaluation.

[[]Copestake etal.1999]

Copestake, A., D. Flickinger, and I. Sag (1999). Minimal Recursion Semantics. An Introduction. Unpublished manuscript, available at http://www.cl.cam.ac.uk/~aac10/papers/newmrs.pdf.

[[]van Deemter and Peters1996]

van Deemter, K. and S. Peters (1996). Semantic Ambiguity and Underspecification. Stanford: CSLI.

[[]Egg etal.2001]

Egg, M., A. Koller, and J. Niehren (2001). The constraint language for lambda structures. Journal of Logic, Language, and Information 10, 457–485.

[[]Flickinger etal.2005]

Flickinger, D., A. Koller, and S. Thater (2005). A new well-formedness criterion for semantics debugging. In Proceedings of the 12th International Conference on HPSG, Lisbon.

[[]Fuchss etal.2004]

Fuchss, R., A. Koller, J. Niehren, and S. Thater (2004). Minimal recursion semantics as dominance constraints: Translation, evaluation, and analysis. In Proceedings of the 42nd ACL, Barcelona.

[[]Koller2004]

Koller, A. (2004). Constraint-based and graph-based resolution of ambiguities in natural language. Ph. D. thesis, Universität des Saarlandes.

[[]Koller etal.2003]

Koller, A., J. Niehren, and S. Thater (2003). Bridging the gap between underspecification formalisms: Hole semantics as dominance constraints. In Proceedings of the 11th EACL, Budapest.

[[]Koller and Thater2005]

Koller, A. and S. Thater (2005). The evolution of dominance constraint solvers. In Proceedings of the ACL-05 Workshop on Software, Ann Arbor.

[[]Koller and Thater2006]

Koller, A. and S. Thater (2006). An improved redundancy elimination algorithm for underspecified descriptions. In Proceedings of the 44th ACL/21st COLING, Sydney.

[[]Niehren and Thater2003]

Niehren, J. and S. Thater (2003). Bridging the gap between underspecification formalisms: Minimal recursion semantics as dominance constraints. In 41st Meeting of the Association of Computational Linguistics, 367–374.

[[]Oepen etal.2002]

Oepen, S., K. Toutanova, S. Shieber, C. Manning, D. Flickinger, and T. Brants (2002). The LinGO Redwoods treebank: Motivation and preliminary applications. In Proceedings of the 19th International Conference on Computational Linguistics (COLING'02), 1253–1257.