A linear logic treatment of phrase structure grammars for unbounded dependencies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1582, Issue , 1999, Pages 160-179

  Hodas, Joshua S ^a  

^a HARVEY MUDD COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; LINEAR ALGEBRA;

CATEGORIAL GRAMMAR; COORDINATION CONSTRAINTS; LINEAR LOGIC; PHRASE STRUCTURE GRAMMARS; UNBOUNDED DEPENDENCIES;

COMPUTER CIRCUITS;

EID: 84949566513     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48975-4_8     Document Type: Conference Paper

References (29)

1. Mary Dalrymple, John Lamping, Fernando Pereira, and Vijay Saraswat. Linear logic for meaning assembly. In Proceedings of the Workshop on Computational Logic for Natural Language Processing, 1995.
2. Mary Dalrymple, John Lamping, Fernando Pereira, and Vijay Saraswat. A Deductive Account of Quantification in LFG. Center for the Study of Language and Information, Stanford, California, 1996.
3. Mary Dalrymple, John Lamping, Fernando Pereira, and Vijay Saraswat. Quantifiers, anaphora, and intensionality. Journal of Logic, Language, and Information, 6(3):219–273, 1997.
4. Gerald J. M. Gazdar. Unbounded dependencies and coordinate structure. Linguistic Inquiry, 12(2):154–184, 1981.
5. Gerald J. M. Gazdar. Phrase structure grammar. In P. Jacobson and G. K. Pullum, editors, The Nature of Syntactic Representation, pages 131–186. Reidel, Dordrecht, 1982.
6. Gerald J. M. Gazdar, Ewan Klein, Geoffrey K. Pullum, and Ivan Sag. Generalized Phrase Structure Grammar. Harvard University Press, Cambridge, Mass., 1985.
7. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.
8. Mark Hepple. Hybrid categorial logics. Bulletin of the Interest Group in Pure and Applied Logics, 3(2.3), 1995.
9. Joshua Hodas. Specifying filler-gap dependency parsers in a linear-logic programming language. In K. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 622–636, 1992.
10. Joshua S. Hodas. Logic Programming in Intuitionistic Linear Logic: Theory, Design, and Implementation. PhD thesis, University of Pennsylvania, Department of Computer and Information Science, May 1994.
11. Joshua S. Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic. Journal of Information and Computation, 1994. To appear.
12. Joshus Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic: Extended abstract. In G. Kahn, editor, Sixth Annual Symposium on Logic in Computer Science, pages 32–42, Amsterdam, July 1991.
13. Mark Johnson. Resource-sensitivity in lexical-functional grammar. In Proceedings of the Roma Workshop, 1996.
14. A.K. Joshi. An introduction to tree adjoining grammars. In A. Manaster-Ramer, editor, The Mathematics of Language. Benjamins, 1986.
15. Aravind K. Joshi. Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural description? In David Dowty, Lauri Karttunen, and Arnold Zwicky, editors, Natural language processing: psycholinguistic, computational and theoretical perspectives, pages 206–250. Cambridge University Press, New York, 1983.
16. Max Kanovich. The expressive power of initial fragments of linear logic. A talk given at the Linear Logic Workshop, Cornell University, June 1993.
17. J. Lambek. The mathematics of sentence structure. American Mathematical Monthly, 65:154–169, 1958.
18. J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge University Press, 1986.
19. P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Technical Report SRI-CSL-90-08, SRI International, 1990.
20. Michael Moortgat. Unambiguous proof representations for the lambek calculus. In Proceedings of the 8th Amsterdam Colloquium, 1991.
21. Glyn Morrill. Clausal proof nets and discontinuity. In Proceedings of the London Workshop on Proof Theory and Linguistic Analysis, 1994.
22. Gopalan Nadathur and Dale Miller. An Overview of λProlog. In Fifth International Logic Programming Conference, pages 810–827, Seattle,Washington, August 1988. MIT Press.
23. Richard T. Oehrle. Forms of labeled categorial type deduction. In Proceedings of the London Workshop on Proof Theory and Linguistic Analysis, 1994.
24. Remo Pareschi. Type-driven Natural Language Analysis. PhD thesis, University of Edinburgh, 1989.
25. Remo Pareschi and Dale Miller. Extending definite clause grammars with scoping constructs. In David D. H. Warren and Peter Szeredi, editors, 1990 International Conference in Logic Programming, pages 373–389. MIT Press, June 1990.
26. Fernando C. N. Pereira and Stuart M. Shieber. Prolog and Natural-Language Analysis, volume 10. CLSI, Stanford, CA, 1987.
27. Dirk Roorda. Resource Logics: Proof-Theoretical Investigations. PhD thesis, University of Amsterdam, 1991.
28. John Robert Ross. Constraints on Variables in Syntax. PhD thesis, Massachusetts Institute of Technology, 1967.
29. Mark J. Steedman. Combinators and grammars. In Bach Oehrle and Wheeler, editors, Categorial Grammars and Natural Language Structures, 1988.