Constraints over Lambda-Structures in semantic underspecification
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
D-theory: talking about talking about trees
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
On determining the consistency of partial descriptions of trees
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
A polynomial-time fragment of dominance constraints
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
The Constraint Language for Lambda Structures
Journal of Logic, Language and Information
Dominance constraints with Boolean connectives: a model-eliminative treatment
Theoretical Computer Science - Algebraic methods in language processing
Parallelism and Tree Regular Constraints
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
A relational syntax-semantics interface based on dependency grammar
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Efficient solving and exploration of scope ambiguities
ACLdemo '05 Proceedings of the ACL 2005 on Interactive poster and demonstration sessions
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
| Hi-index | 0.00 |
We propose a new inference system which operates on underspecified semantic representations of scope and anaphora. This system exploits anaphoric accessibility conditions from dynamic semantics to disambiguate scope ambiguities if possible. The main feature of the system is that it deals with underspecified descriptions directly, i. e. without enumerating readings.