Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Non-Associative Lambek Calculus with Product in Polynomial Time
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Product-Free Lambek Calculus Is NP-Complete
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Symmetries in natural language syntax and semantics: the Lambek-Grishin calculus
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
The generative capacity of the lambek-grishin calculus: a new lower bound
FG'09 Proceedings of the 14th international conference on Formal grammar
The product-free Lambek-Grishin calculus is NP-complete
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
| Hi-index | 0.00 |
The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL. In this paper we prove that the derivability problem for LG is NP-complete.