Abstract
The simply typed λ-calculus can be taken as the basis of a formalism in which we assign meaning to the basic expressions of a natural language and explain the meaning of larger constituents by the composition of the meaning of their parts. However, under a conventional higher-order semantic for the λ-calculus, we cannot give a model generation method based on the well-known techniques of first-order model generation. By weakening the semantic of higher-order logic, we formulate a logical language that has the compositional expressivity of a higher-order logic but the finitely representable models of a first-order one. A generic model generation technique for this language is presented and discussed, and a refinement for minimal model generation is introduced.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Konrad, K. (2004). 3 Higher-Order Model Generation. In: Model Generation for Natural Language Interpretation and Analysis. Lecture Notes in Computer Science(), vol 2953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24640-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-24640-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21069-6
Online ISBN: 978-3-540-24640-4
eBook Packages: Springer Book Archive