A dynamic programming approach to categorial deduction

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: Conference
• Year: 1999
• Where: CADE
• Authors: Philippe de Groote
• Keywords: CADE 1999, Categorial Deduction Algorithm, Cocke-Kasami-Younger Parsing Algorithm, Context-free Parsing Problem, Logical Reasoning