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.
https://hal.inria.fr/inria-00100816
Contributor : Publications Loria
<>
Submitted on : Tuesday, September 26, 2006 - 2:51:28 PM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM
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⟩
