A dynamic programming approach to categorial deduction

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 reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, allows us to derive an automatic categorial deduction algorithm akin to the well-known Cocke-Kasami-Younger parsing algorithm.
Type de document :
Communication dans un congrès
H. Ganzinger. 16th International Conference on Automated Deduction - CADE-16, 1999, Trento, Italy, Springer Verlag, 1632, pp.1--15, 1999, Lecture Notes in Artificial Intelligence
Liste complète des métadonnées

https://hal.inria.fr/inria-00100816
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:51:28
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00100816, version 1

Collections

Citation

Philippe De Groote. A dynamic programming approach to categorial deduction. H. Ganzinger. 16th International Conference on Automated Deduction - CADE-16, 1999, Trento, Italy, Springer Verlag, 1632, pp.1--15, 1999, Lecture Notes in Artificial Intelligence. 〈inria-00100816〉

Partager

Métriques

Consultations de la notice

54