Monotonic semantic interpretation, Proceedings of the 30th annual meeting on Association for Computational Linguistics -, pp.32-39, 1992. ,
DOI : 10.3115/981967.981972
URL : http://acl.ldc.upenn.edu/P/P92/P92-1005.pdf
An efficient graph algorithm for dominance constraints, Journal of Algorithms, vol.48, issue.1, 2003. ,
DOI : 10.1016/S0196-6774(03)00050-6
URL : https://hal.archives-ouvertes.fr/inria-00536539
Predicate logic unplugged, Proc. 10th Amsterdam Colloquium, pp.133-143, 1996. ,
Underspecification and resolution in discourse semantics, 2002. ,
The constraint language for lambda structures, Journal of Logic, Language and Information, vol.10, issue.4, pp.457-485, 2001. ,
DOI : 10.1023/A:1017964622902
URL : https://hal.archives-ouvertes.fr/inria-00536795
Processing underspecified semantic representations in the constraint language for lambda structures, Research in Language and Computation, 2002. ,
URL : https://hal.archives-ouvertes.fr/inria-00536796
Describing discourse semantics, Proceedings of the 4th TAG+ Workshop, 1998. ,
Relaxing underspecified semantic representations for reinterpretation, Grammars, vol.3, issue.2-3, 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00536811
Dealing with Ambiguities by Underspecification: Construction, Representation and Deduction, Journal of Semantics, vol.10, issue.2, pp.123-179, 1993. ,
DOI : 10.1093/jos/10.2.123
OBTAINING TREES FROM THEIR DESCRIPTIONS: AN APPLICATION TO TREE-ADJOINING GRAMMARS, Computational Intelligence, vol.18, issue.4, pp.401-421, 1994. ,
DOI : 10.1111/j.1467-8640.1994.tb00005.x
A linear time algorithm for the configuration problem of dominance graphs, 2002. ,