Results 11 to 20 of about 107,210 (140)
Lambek calculus is NP-complete [PDF]
Theoretical Computer Science, 2006 The main goal of the paper is to show that the derivability problems for the Lambek calculus (L) and for the Lambek calculus allowing empty premises (L*) are NP-complete. The construction of a reduction from the problem CSAT to the L-derivability and L*-derivability problems is described, and the correctness of this reduction is proved.
Pentus, Mati
openaire +4 more sources
Lambek vs. Lambek: Functorial vector space semantics and string diagrams for Lambek calculus
Annals of Pure and Applied Logic, 2013 29 pages, pending publication in Annals of Pure and Applied ...
Bob Coecke +2 more
openaire +5 more sources
Product-free Lambek calculus is NP-complete [PDF]
, 2012 In this paper, we prove that the derivability problems for product-free Lambek calculus and product-free Lambek calculus allowing empty premises are NP-complete.
Savateev, Yury, Yury Savateev
core +1 more source
A proof-theoretic approach to scope ambiguity in compositional vector space models
Journal of Language Modelling, 2019 We investigate the extent to which compositional vector space models can be used to account for scope ambiguity in quantified sentences (of the form Every man loves some woman).
Gijs Wijnholds
doaj +1 more source
On Involutive Nonassociative Lambek Calculus [PDF]
Journal of Logic, Language and Information, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Combining logical and distributional methods in type-logical grammars
Journal of Language Modelling, 2019 We propose a low-level way of combining distributional and logical ideas into a single formal system. This will be an instantiation of a more general system, adding weights to proof rules. These weights will not measure some sort of "confidence the proof
Richard Moot
doaj +1 more source
A type-logical treebank for French
Journal of Language Modelling, 2015 The goal of the current paper is to describe the TLGbank, a treebank of type-logical proof semi-automatically extracted from the French Treebank. Though the framework chosen for the treebank are multimodal type-logical grammars, we have ensured that the ...
Richard Moot
doaj +1 more source
FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE [PDF]
The Journal of Symbolic Logic, 2016 AbstractWe prove that the set of formulae provable in the full Lambek calculus with the structural rule of contraction is undecidable. In fact, we show that the positive fragment of this logic is undecidable.
Karel Chvalovský, Rostislav Horcík
openaire +4 more sources
Continuations and Polymorphic Lambek Calculus (Logic, Language, Algebraic system and Related Areas in Computer Science) [PDF]
, 2021 We introduced the notion of continuation in lambda calculus for Lambek calculus and showed that the continuation-passing style transformation could be naturally derived from the rules of Lambek calculus.
Taniguchi, Masaya
core
Cyclic Shift in the Lambek Calculus
CoRR, 2021 We enrich the Lambek calculus with the cyclic shift operation, which is expected to model the closure operator of formal languages with respect to cyclic shifts. We introduce a Gentzen-style calculus and prove cut elimination. Secondly, we turn to categorial grammars based on this calculus and show that they can generate non-context-free languages ...
openaire +2 more sources