6 search results - page 1 / 2 » The Lambek-Grishin calculus is NP-complete |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
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.
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Grishin ([10]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([15]), who spok...
WOLLIC
2007
Springer
13 years 10 months ago
2007
Springer
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...
IANDC
2010
13 years 3 months ago
2010
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
CORR
2010
Springer
13 years 4 months ago
2010
Springer