A dynamic programming approach to categorial deduction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

A dynamic programming approach to categorial deduction

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.

Domains

Other [cs.OH]
Not file

Dates and versions

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

Identifiers

  • HAL Id : inria-00100816 , version 1

Cite

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⟩
41 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More