Efficient linear logic meaning assembly

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 1, Issue , 1998, Pages 464-470

  Gupta, Vineet ^a   Lamping, John ^b  

^a NASA AMES RESEARCH CENTER   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR LOGIC;

COMPUTER CIRCUITS;

EID: 85119090681     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Richard Crouch and Josef van Genabith. 1997. How to glue a donkey to an f-structure, or porting a dynamic meaning representation into LFG's linear logic based glue-language semantics. Paper to be presented at the Second International Workshop on Computational Semantics, Tilburg, The Netherlands, January 1997.
2. Mary Dalrymple, John Lamping, and Vijay Saraswat. 1993. LFG semantics via constraints. In Proceedings of the Sixth Meeting of the European ACL, pages 97-105, University of Utrecht. European Chapter of the Association for Computational Linguistics.
3. Mary Dalrymple, John Lamping, Fernando C. N. Pereira, and Vijay Saraswat. 1995. Linear logic for meaning assembly. In Proceedings of CLNLP, Edinburgh.
4. Mary Dalrymple, John Lamping, Fernando C. N. Pereira, and Vijay Saraswat. 1996. Intensional verbs without type-raising or lexical ambiguity. In Jerry Seligman and Dag Westerstâhl, editors, Logic, Language and Computation, pages 167-182. CSLI Publications, Stanford University.
5. Mary Dalrymple, Vineet Gupta, John Lamping, and Vijay Saraswat. 1997a. Relating resource-based semantics to categorial semantics. In Proceedings of the Fifth Meeting on Mathematics of Language (MOL5), Schloss Dagstuhl, Saarbrücken, Germany.
6. Mary Dalrymple, John Lamping, Fernando C. N. Pereira, and Vijay Saraswat. 1997b. Quantifiers, anaphora, and intensionality. Journal of Logic, Language, and Information, 6 (3) :219-273.
7. Mark Hepple. 1996. A compilation-chart method for linear categorical deduction. In Proceedings of COLING-96, Copenhagen.
8. Max I. Kanovich. 1992. Horn programming in linear logic is NP-complete. In Seventh Annual IEEE Symposium on Logic in Computer Science, pages 200-210, Los Alamitos, California. IEEE Computer Society Press.
9. Uwe Reyle. 1993. Dealing with ambiguities by underspecification: Construction, representation, and deduction. Journal of Semantics, 10:123-179.