The Lambek-Grishin Calculus Is NP-Complete
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7395)
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.
KeywordsInference 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.
Unable to display preview. Download preview PDF.
- 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
- Lambek, J.: On the calculus of syntactic types. In: Structure of Language and Its Mathematical Aspects, pp. 166–178 (1961)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
© Springer-Verlag Berlin Heidelberg 2012