The Non-Associative Lambek Calculus with Product in Polynomial Time

Authors:
Philippe de Groote
Affiliations:
-
Venue:
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Year:
1999

Citing 1
Cited 6

Linear logic

Theoretical Computer Science

Product-Free Lambek Calculus Is NP-Complete

LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
LC graphs for the Lambek calculus with product

MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
The product-free Lambek-Grishin calculus is NP-complete

LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
k-valued non-associative lambek grammars (without product) form a strict hierarchy of languages

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Combinatory categorial grammar as a substructural logic: preliminary remarks

JSAI-isAI'10 Proceedings of the 2010 international conference on New Frontiers in Artificial Intelligence
The Lambek-Grishin calculus is NP-Complete

FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open prolem.