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.
Type de document :
Communication dans un congrès
Neil V. Murray. Automatic Reasoning with Analytic Tableaux and Related Methods, Jun 1999, Saratoga Springs, NY USA, Springer Verlag, 1617, pp.128-139, 1999, Lecture Notes in Artificial Intelligence
Liste complète des métadonnées

https://hal.inria.fr/inria-00108070
Contributeur : Publications Loria <>
Soumis le : jeudi 19 octobre 2006 - 15:40:44
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00108070, version 1

Collections

Citation

Philippe De Groote. The Non-associative Lambek calculus with product in polynomial time. Neil V. Murray. Automatic Reasoning with Analytic Tableaux and Related Methods, Jun 1999, Saratoga Springs, NY USA, Springer Verlag, 1617, pp.128-139, 1999, Lecture Notes in Artificial Intelligence. 〈inria-00108070〉

Partager

Métriques

Consultations de la notice

60