Results 61 to 70 of about 107,210 (140)
Product-Free Lambek Calculus Is NP-Complete
, 2009 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.
Yury Savateev
core
The Lambek-Grishin Calculus Is NP-Complete [PDF]
, 2012 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.
openaire +3 more sources
Proof Nets for the Lambek–Grishin Calculus [PDF]
, 2013 Revised version to appear as a chapter in E. Grefenstette, C. Heunen, and M.
Moortgat, M.J., Moot, R.C.A.
openaire +5 more sources
Continuation semantics for the Lambek–Grishin calculus
Information and Computation, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernardi, Raffaella, M. Moortgat
openaire +4 more sources
Preliminaries to the Lambek Calculus
, 2008 Summary. Some preliminary facts concerning completeness and decidability problems for the Lambek calculus [13] are proved as well as some theses and derived rules of the calculus itself.
Wojciech Zielonka, De Louvain
core
Theory of Discontinuous Lambek Calculus [PDF]
, 2012 Aquesta tesi s'emmarca dins del camp de la lingüística matemàtica, concretament en la branca de la gramàtica lògica de tipus, disciplina íntimament relacionada amb la teoria de la demostració.
Valentín Gallart, Oriol
core
A graph formalism for proofs in the Lambek calculus with product [PDF]
, 2006 Since the introduction of the Lambek calculus in Lambek (1958), there has been a great deal of interest in its usefulness as a grammar for parsing in natural language.
Fowler, Timothy Alexander Dalton
core
Obligations of the "Gift": Reciprocity and Responsibility in Precision Medicine. [PDF]
Am J Bioeth, 2021 Lee SS.
europepmc +1 more source
Parsing for Semidirectional Lambek Grammar is NP-Complete
, 1996 We study the computational complexity of the parsing problem of a variant of Lambek Categorial Grammar that we call semidirectional. In semidirectional Lambek calculus SDL there is an additional nondirectional abstraction rule allowing the formula ...
Jochen Dörre +2 more
core
Lambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars [PDF]
, 2008 International audienceTwo recent extension of the non-associative Lambek calculus, the Lambek-Grishin calculus and the multimodal Lambek calculus, are shown to generate the same class of languages as tree adjoining grammars, using (tree generating ...
Moot, Richard
core +2 more sources