Extending definite clause grammars with scoping constructs
Logic programming
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Efficient implementation of a linear logic programming language
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Type-driven natural language analysis
Type-driven natural language analysis
Tuples, discontinuity, and gapping in categorial grammar
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Higher-order linear logic programming of categorial deduction
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Higher-order linear logic programming of categorial deduction
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Maximal incrementality in linear categorial deduction
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
Memoisation for glue language deduction and categorial parsing
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
A compilation-chart method for linear categorial deduction
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
An Earley-style predictive chart parsing method for Lambek grammars
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Logical approximation for program analysis
Higher-Order and Symbolic Computation
| Hi-index | 0.01 |
We show how categorial deduction can be implemented in higher-order (linear) logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing problem of Lambek categorial grammar applicable to a variety of its extensions.