Abstract
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 the product-free fragment of LG is NP-complete, thus improving on Bransen (2010) where this is shown for LG with product.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bransen, J.: The Lambek-Grishin calculus is NP-complete. In: Proceedings 15th Conference on Formal Grammar, Copenhagen (2010) (to appear)
de Groote, P.: The Non-associative Lambek Calculus with Product in Polynomial Time. In: Murray, N.V. (ed.) TABLEAUX 1999. LNCS (LNAI), vol. 1617, pp. 128–139. Springer, Heidelberg (1999)
Foret, A.: On the computation of joins for non associative Lambek categorial grammars. In: Proceedings of the 17th International Workshop on Unification (UNIF 2003), Valencia, Spain, June 8-9 (2003)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
Goré, R.: Substructural logics on display. Logic Jnl IGPL 6(3), 451–504 (1998)
Kandulski, M.: The non-associative Lambek calculus. In: Categorial Grammar. Linguistic and Literary Studies in Eastern Europe (LLSEE), vol. 25, pp. 141–151 (1988)
Lambek, J.: The Mathematics of Sentence Structure. American Mathematical Monthly 65, 154–170 (1958)
Lambek, J.: On the calculus of syntactic types. In: Structure of Language and Its Mathematical Aspects, pp. 166–178 (1961)
Melissen, M.: The Generative Capacity of the Lambek-Grishin Calculus: A New Lower Bound. In: de Groote, P., Egg, M., Kallmeyer, L. (eds.) Formal Grammar. LNCS, vol. 5591, pp. 118–132. Springer, Heidelberg (2011)
Moortgat, M.: Symmetries in Natural Language Syntax and Semantics: The Lambek-Grishin Calculus. In: Leivant, D., de Queiroz, R. (eds.) WoLLIC 2007. LNCS, vol. 4576, pp. 264–284. Springer, Heidelberg (2007)
Moortgat, M.: Symmetric categorial grammar. Journal of Philosophical Logic 38(6), 681–710 (2009)
Moot, R.: Proof nets for display logic. CoRR, abs/0711.2444 (2007)
Pentus, M.: The conjoinability relation in Lambek calculus and linear logic. ILLC Prepublication Series ML–93–03, Institute for Logic, Language and Computation, University of Amsterdam (1993a)
Pentus, M.: Lambek grammars are context free. In: Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science, pp. 429–433. IEEE Computer Society Press, Los Alamitos (1993b)
Pentus, M.: Lambek calculus is NP-complete. CUNY Ph.D. Program in Computer Science Technical Report TR–2003005, CUNY Graduate Center, New York (2003)
Pentus, M.: A Polynomial-Time Algorithm for Lambek Grammars of Bounded Order. Linguistic Analysis 36, 441–472 (2010)
Savateev, Y.: Product-Free Lambek Calculus Is NP-Complete. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 380–394. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bransen, J. (2011). The Product-Free Lambek-Grishin Calculus Is NP-Complete. In: Pogodalla, S., Prost, JP. (eds) Logical Aspects of Computational Linguistics. LACL 2011. Lecture Notes in Computer Science(), vol 6736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22221-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-22221-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22220-7
Online ISBN: 978-3-642-22221-4
eBook Packages: Computer ScienceComputer Science (R0)