A dynamic programming approach to categorial deduction - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

A dynamic programming approach to categorial deduction

Résumé

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.

Domaines

Autre [cs.OH]
Fichier non déposé

Dates et versions

inria-00100816 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00100816 , version 1

Citer

Philippe de Groote. A dynamic programming approach to categorial deduction. 16th International Conference on Automated Deduction - CADE-16, 1999, Trento, Italy, pp.1--15. ⟨inria-00100816⟩
42 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More