Skip to main content

The Lambek-Grishin Calculus Is NP-Complete

  • Conference paper
  • 728 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7395)

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 LG is NP-complete.

Keywords

  • Inference Rule
  • Conjunctive Normal Form
  • Logical Rule
  • Boolean Formula
  • Satisfying Assignment

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • 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)

    CrossRef  Google Scholar 

  • 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)

    Google Scholar 

  • Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)

    MATH  Google Scholar 

  • Goré, R.: Substructural logics on display. Logic Jnl IGPL 6(3), 451–504 (1998)

    CrossRef  MATH  Google Scholar 

  • Kandulski, M.: The non-associative Lambek calculus. Categorial Grammar, Linguistic and Literary Studies in Eastern Europe (LLSEE) 25, 141–151 (1988)

    MathSciNet  Google Scholar 

  • Lambek, J.: The Mathematics of Sentence Structure. American Mathematical Monthly 65, 154–170 (1958)

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Lambek, J.: On the calculus of syntactic types. In: Structure of Language and Its Mathematical Aspects, pp. 166–178 (1961)

    Google Scholar 

  • 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)

    CrossRef  Google Scholar 

  • 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)

    CrossRef  Google Scholar 

  • Moortgat, M.: Symmetric categorial grammar. Journal of Philosophical Logic 38(6), 681–710 (2009)

    CrossRef  MathSciNet  MATH  Google Scholar 

  • 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 (1993)

    CrossRef  Google Scholar 

  • Pentus, M.: Lambek calculus is NP-complete. CUNY Ph.D. Program in Computer Science Technical Report TR–2003005. CUNY Graduate Center, New York (2003)

    Google Scholar 

  • 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)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bransen, J. (2012). The Lambek-Grishin Calculus Is NP-Complete. In: de Groote, P., Nederhof, MJ. (eds) Formal Grammar. FG FG 2010 2011. Lecture Notes in Computer Science, vol 7395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32024-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32024-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32023-1

  • Online ISBN: 978-3-642-32024-8

  • eBook Packages: Computer ScienceComputer Science (R0)