Introduction to artificial intelligence
Introduction to artificial intelligence
The Representation of Noun Phrases In Logical Form
The Representation of Noun Phrases In Logical Form
Foundations of a logic of knowledge, action, and communication
Foundations of a logic of knowledge, action, and communication
The representation of noun phrases in logical form
The representation of noun phrases in logical form
An improper treatment of quantification in ordinary English
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Logical Forms in the core language engine
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
An integrated framework for semantic and pragmatic interpretation
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Stroing logical form in a shared-packed forest
Computational Linguistics
Towards a cognitively plausible model for quantification
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
A pragmatic treatment of quantification in natural language
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Managing Multiple Knowledge Sources In Constraint-Based Parsing Of Spoken Language
Fundamenta Informaticae
| Hi-index | 0.00 |
In this paper, logical form representations for pronouns, singular definite noun phrases (NPs), and singular indefinite NPs are developed. These representations allow decisions about the precise meaning of a sentence to be postponed until the required information becomes available. Three computational constraints for this logical form are proposed: compactness, modularity, and formal consistency. Initially, NPs are represented using a composite representation for all allowable meanings, conforming with the compactness constraint. This representation is provided using only syntactic and sentence level information, consistent with the modularity constraint. When an ambiguity can be resolved, the precise behavior is specified in a way compatible with the initial representation, conforming with the formal consistency constraint. The scope of this approach is demonstrated by using a wide variety of examples, and a computer implementation is described. Related approaches are also discussed.