Planning Routes through uncertain territory
Artificial Intelligence
Constraint propagation with interval labels
Artificial Intelligence
Representing and acquiring geographic knowledge
Representing and acquiring geographic knowledge
Readings in qualitative reasoning about physical systems
Readings in qualitative reasoning about physical systems
Constraint reasoning based on interval arithmetic: the tolerance propagation approach
Artificial Intelligence - Special volume on constraint-based reasoning
On the Logical Structure of Comparatives
Proceedings of the International Symposium on Natural Language and Logic
"Tall", "good", "high": compared to what?
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Grading knowledge: extracting degree information from texts
Grading knowledge: extracting degree information from texts
Hi-index | 0.00 |
Linguistic access to uncertain quantitative knowledge about physical properties is provided by dimensional adjectives, e.g. long-short in the spatial and temporal senses, near-far, fast-slow, etc. Semantic analyses of the dimensional adjectives differ on whether the meaning of the differential comparative (6 cm shorter than) and the equative with factor term (three times as long as) is a compositional function of the meanings the difference and factor terms (6 cm and three times) and the meanings of the simple comparative and equative, respectively. The compositional treatment comes at the price of a meaning representation that some authors ([Pinkal, 1990], [Klein, 1991]) find objectionally unparsimonious. In this paper, I compare semantic approaches by investigating the complexity of reasoning that they entail; specifically, I show the complexity of constraint propagation over real-valued intervals using the Waltz algorithm in a system where the meaning representations of sentences appear as constraints (cf. [Davis, 1987]). It turns out that the compositional account is more complex on this measure. However, I argue that we face a tradeoff rather than a knock-down argument against compositionality, since the increased complexity of the compositional approach may be manageable if certain assumptions about the application domain can be made.