Theoretical Computer Science
Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Categorial semantics and scoping
Computational Linguistics
A logic programming language with Lambda-abstraction, function variables, and simple unification
Proceedings of the international workshop on Extensions of logic programming
Semantic interpretation as higher-order deduction
JELIA '90 Proceedings of the European workshop on Logics in AI
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Semantic abstraction and anaphora
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 1
A Resource Sensitive Interpretation of Lexical Functional Grammar
Journal of Logic, Language and Information
Journal of Logic, Language and Information
A Linear Logic Treatment of Phrase Structure Grammars for Unbounded Dependencies
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
PHORA: A NLP System for Spanish
CICLing '01 Proceedings of the Second International Conference on Computational Linguistics and Intelligent Text Processing
Bidirectional contextual resolution
Computational Linguistics
Negative polarity licensing at the syntax-semantics interface
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Efficient linear logic meaning assembly
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Hi-index | 0.00 |
The relationship between Lexical-Functional Grammar (LFG) functional structures (f-structures) for sentences and their semanticinterpretations can be formalized in linear logic in a way thatcorrectly explains the observed interactions between quantifier scopeambiguity, bound anaphora and intensionality.Our linear-logic formalization of the compositional properties ofquantifying expressions in natural language obviates the need forspecial mechanisms, such as Cooper storage, in representing thescoping possibilities of quantifying expressions. Instead, thesemantic contribution of a quantifier is recorded as a linear-logicformula whose use in a proof will establish the scope of thequantifier. Different proofs can lead to different scopes. In eachcomplete proof, the properties of linear logic ensure thatquantifiers are properly scoped.The interactions between quantified NPs and intensional verbs such as’’seek‘‘ are also accounted for in this deductive setting. A singlespecification in linear logic of the argument requirements ofintensional verbs is sufficient to derive the correct readingpredictions for intensional-verb clauses both with nonquantified andwith quantified direct objects. In particular, both de dictoand de re readings are derived for quantified objects. Theeffects of type-raising or quantifying-in rules in other frameworksjust follow here as linear-logic theorems.While our approach resembles current categorial approaches inimportant ways (Moortgat, 1988, 1992a; Carpenter, 1993; Morrill, 1994)it differs from them in allowing the greater compositional flexibility ofcategorial semantics (van Benthem, 1991)while maintaining a precise connection to syntax. As a result, we areable to provide derivations for certain readings of sentences withintensional verbs and complex direct objects whose derivation inpurely categorial accounts of the syntax-semantics interface appearsto require otherwise unnecessary semantic decompositions of lexicalentries.