The Non-associative Lambek calculus with product in polynomial time

Philippe de Groote 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with \mbox{product} belongs to PTIME. This solves an open problem.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00108070
Contributor : Publications Loria <>
Submitted on : Thursday, October 19, 2006 - 3:40:44 PM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM

Identifiers

  • HAL Id : inria-00108070, version 1

Collections

Citation

Philippe de Groote. The Non-associative Lambek calculus with product in polynomial time. Automatic Reasoning with Analytic Tableaux and Related Methods, Jun 1999, Saratoga Springs, NY USA, pp.128-139. ⟨inria-00108070⟩

Share

Metrics

Record views

73