Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

CADE
1999
Springer

favoriteEmaildiscussreport

119views Logical Reasoning» more CADE 1999»

A dynamic programming approach to categorial deduction

13 years 9 months ago

A dynamic programming approach to categorial deduction

Download www.loria.fr

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.

Philippe de Groote

Real-time Traffic

CADE 1999 | Categorial Deduction Algorithm | Cocke-Kasami-Younger Parsing Algorithm | Context-free Parsing Problem | Logical Reasoning |

claim paper

Related Content

» A Natural Deduction Approach to Dynamic Logic

» Forward Slicing by Conjunctive Partial Deduction and Argument Filtering

» NonDeterminism in Deductive Databases

» Predicate learning and selective theory deduction for a difference logic solver

» Semantic Interpretation as HigherOrder Deduction

» Dynamic Meta Modeling A Graphical Approach to the Operational Semantics of Behavioral Diag...

» Robust Spelling Correction

» Asymmetric RegiontoImage Matching for Comparing Images with Generic Object Categories

» Equations for Describing Dynamic Nets of Communicating Systems

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	CADE
Authors	Philippe de Groote

Comments (0)