Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 2:51:28 PM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM


  • HAL Id : inria-00100816, version 1



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⟩



Record views